以某一位或者某两位为基准中心分别向两边扩展,只要满足s[left] == s[right],即对称条件,就一直扩散,知道非对称时,则找到了此时基准中心对应的最长回文串,至于基准中心考虑到回文串可能大小可能为奇数也可能为偶数,所以要分别以 i 和(i,i+1)为中心扩展
class Solution {
public:
pair<int, int> expandAroundCenter(const string& s, int left, int right) {
while (left >= 0 && right < s.size() && s[left] == s[right]) {
left--;
right++;
}
return {left + 1, right - 1};
}
string longestPalindrome(string s) {
int start = 0, end = 0;
for (int i = 0; i < s.size(); ++i) {
auto [left1, right1] = expandAroundCenter(s, i, i);
auto [left2, right2] = expandAroundCenter(s, i, i + 1);
if (right1 - left1 > end - start) {
start = left1;
end = right1;
}
if (right2 - left2 > end - start) {
start = left2;
end = right2;
}
}
return s.substr(start, end - start + 1);
}
};