![2ccad5f010dcf92320b0bed751671a27.png](https://i-blog.csdnimg.cn/blog_migrate/ff16db3ddfb498105826b4c2d15b3c59.png)
1、
class Solution {
public:
bool huiwen(string s){
int first=0,last=s.size()-1;
while(first<last){
if(s[first]==s[last]){
first++;
last--;
}
else
return false;
}
return true;
}
string longestPalindrome(string s) {
if(s.length()<2)
return s;
string result=s.substr(0,1);
int maxcount=1;
for (int i = s.length() - 1; i >1; i--) {
for (int j = 0; j < s.length(); j++) {
if (i + j <= s.length() && huiwen(s.substr(j,i))) {
result=maxcount>(i-j+1)? result:s.substr(j,i);
maxcount=maxcount>(i-j+1)? maxcount:(i-j+1);
//result=maxcount>(i-j+1)? result:s.substr(j,i);
}
}
}
return result;
}
};