Leetcdoe 5. Longest Palindromic Substring 最长回文子序列

class Solution {
public:
    string longestPalindrome(string s) {
        if(s.size()==0) return s;
        string res;
        for(int i=0; i<s.size()-1; i++){
            string s1 = palindrome(s, j, i);
            string s2 = palindrome(s, i, i+1);
            res = res.size()>s1.size()?res:s1;
            res = res.size()>s2.size()?res:s2;
        }
        return res;
    }
private:
    string palindrome(string s, int l, int r){
        while(l>=0 && r<s.size() &&s[l]==s[r]){
            l--;
            r++;
        }
        return s.substr(l+1, r-l-1);
    }
};