一、思路
从第二个遍历到最后一个,然后每次遍历从中间往两边找,这样可以找到所有的回文串
string longestPalindrome(string s) {
int left;
int right;
int maxLength = 1;
int maxLeft = 0;
for (int i = 1; i < s.size(); i++) {
left = i - 1;
if (s[left] == s[i]) {
solve(left, i, s, maxLength, maxLeft);
}
right = (i == s.size() - 1) ? i : i + 1;
solve(left, right, s, maxLength, maxLeft);
}
return s.substr(maxLeft, maxLength);
}