Solution::longestPalindrome(string A)
123456789101112131415161718192021222324252627282930313233343536373839404142string Solution::longestPalindrome(string A) { string str; int n = A.length(); int first = 1; int second = 0; for(int i = n-1; i >= 0; i--) { int low = i; int high = n-1; int check1 = i; int check2 = n-1; while(low <= high) { if(A[low] == A[high]) { low++;high--; } else if (low == i) { high--; check2 = high; } else { low = i; high = check2-1; check2 = high; } } //cout << check1 << " " << check2 << " "; if(second - first <= check2 - check1 ) { second = check2; first = check1; // cout << first << " "<< second << " "; } } for(int i = first; i <= second; i++) str+=A[i]; return str;}XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
Are there any code examples left?
New code examples in category C++
-
C++ 2023-04-28 17:44:25
-
C++ 2022-03-27 19:20:39 lists occurrences of characters in the string c++
-
C++ 2022-03-27 18:00:14 variabili in c++
-
C++ 2022-03-27 17:10:08 repeat character n times c++
-
C++ 2022-03-27 15:50:07 delete an array c++
-
C++ 2022-03-27 15:40:12 C++ pointer to base class
-
C++ 2022-03-27 12:15:21 find the graph is minimal spanig tree or not
-
C++ 2022-03-27 11:30:15 multi variable assignment cpp
-
C++ 2022-03-27 11:05:17 c++ pi float
-
C++ 2022-03-27 10:20:12 why exceptions can lead to memory leaks