class Solution {
public:
string longestPalindrome(string s) {
string str = "$#";
//统一扩展,解决奇偶差异性问题
for (int i = 0; i < s.size();i++)
{
str += s[i];
str += '#';
}
vector<int> p(str.size(), 0);//p[i]表示以str[i]为中心的回文子串半径
int centre = 0, mx = 0,len=0,cenpos=0;
//mx表示上一个字符所能延伸到的最远距离
for (int i = 1; i < str.size(); i++)
{
if (mx > i)
p[i] = min(p[2 * centre - i], mx - i);
else p[i] = 1;
for (; str[i + p[i]] == str[i - p[i]]; p[i]++);//以str[i]为中心扩展
if (mx<i+p[i])
{
mx = i + p[i];
centre = i;
}
if (len<p[i])
{
len = p[i];
cenpos = i;
}
}
return s.substr((cenpos - len) / 2, len - 1);
}
};