1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54
|
class { public: string longestPalindrome(string s) { int len = s.size(); int b = 0, e = len - 1; int maxl = 1; string maxs = s.substr(0, 1);
while (len - b > maxl) {
while (e - b+1 > maxl) { int l = isPalindromic(s, b, e); if (!l) { --e; continue; }
if (l > maxl) { maxl = l; maxs = s.substr(b, maxl); break; } --e; }
++b; e = len - 1; } return maxs; }
int isPalindromic(string s, int b, int e) { int i = b, j = e; while (i < j) {
if (s[i] != s[j]) return 0; else { ++i; --j; } } return (e - b + 1); } };
|
近期评论