跳转至

5 最长回文子串

思路

class Solution {
public: 
    string Palindrome(string s, int left, int right){
        while(left >= 0 && right < s.size()){
            if(s[left] != s[right])
                break;
            left--;
            right++;
        }
        return s.substr(left + 1, right - left - 1);
    }
    string longestPalindrome(string s) {
        string res = "";
        for(int i = 0; i < s.size(); i++){
            string s1 = Palindrome(s, i, i);
            string s2 = Palindrome(s, i, i + 1);
            res = res.size() > s1.size() ? res : s1; 
            res = res.size() > s2.size() ? res : s2; 
        }
        return res;
    }
};