1 class Solution {
2 public:
3 string longestPalindrome(string s) {
4 int max_len = 0;
5 string ans;
6 for (int i = 0; i < s.length(); i++)
7 {
8 for (int j = s.length() -1; j >= 0 ; j--)
9 {
10 if (s[j] != s[i])continue;
11 if (j - i + 1 <= max_len)break;
12
13 int ii = i;
14 int jj = j;
15 while (ii< s.length() && jj >=0 &&
16 s[ii]==s[jj]&& ii<=jj){
17 ii++;
18 jj--;
19 }
20 if (ii == jj + 1 || ii == jj + 2)
21 {
22 max_len = j - i + 1;
23 ans = s.substr(i, max_len);
24 }
25 }
26 }
27 return ans;
28 }
29 };