Leetcode 第五题：最长回文子串（优雅的中心扩散法写法）

 

class Solution {
public:
    string longestPalindrome(string s) {
        int maxLen = 0, resLeft, resRight;
        for(int i = 0; i < s.size(); i++){
            auto [left1, right1] = expandAroundCenter(s,i-1,i);
            auto [left2, right2] = expandAroundCenter(s,i,i);
            if(right1 - left1 + 1 > maxLen){
                resLeft = left1;
                resRight = right1;
                maxLen = resRight - resLeft + 1;
            }
            if(right2 - left2 + 1 > maxLen){
                resLeft = left2;
                resRight = right2;
                maxLen = resRight - resLeft + 1;
            }
        }
        return s.substr(resLeft,resRight - resLeft + 1);
    }

    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};
    }
};

 

 

更优雅的写法：

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);
    }
};