Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Longest Palindrom in String
//Title of this code #include <iostream> #include <string> using namespace std; int expandPalindrom(string& s, int l, int r) { while (l >= 0 && r <= s.length() - 1 && s[l] == s[r]) { --l; ++r; } return r - l - 1; } int longestPalindrom(string& s) { if (s.length() <= 1) return 1; int longest = 1; for (int i = 1; i < s.length(); ++i) { int l1 = expandPalindrom(s, i, i); int l2 = 0; if (i + 1 < s.length()) l2 = expandPalindrom(s, i, i + 1); longest = max(longest, max(l1, l2)); } return longest; } int main() { string s = "abbacfabba"; cout << longestPalindrom(s); }
run
|
edit
|
history
|
help
0
Exempel 4
First and last Occurence of an Element
HeapSort
floyd alfa 1
precision and fixed point notation
IviewwithSelf
ADAKOHL - hpclearn
Memory_test
Luces led con relé
Roger Cheng