5. Longest Palindromic Substring

https://leetcode.com/problems/longest-palindromic-substring/

Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.

Example 1:

Input: "babad"
Output: "bab"
Note: "aba" is also a valid answer.

Example 2:

Input: "cbbd"
Output: "bb"

//方法1：中心扩展算法O(n^2)
//aba  以中间b为中心
//abba 以bb中间位置为中心
//故n个字符会产生2n-1的中心
//16 ms	8.7 MB
class Solution {
public:
    string longestPalindrome(string s) {
        if(s.size()<=1) return s;
        int start=0,end=0;
        for(int i=0;i<s.size();i++){
            int len1=expandAroundCenter(s,i,i);
            int len2=expandAroundCenter(s,i,i+1);
            int len=max(len1,len2);
            if(len>end-start+1){
                start=i-(len-1)/2;
                end=i+len/2;
            }
        }
        return s.substr(start,end-start+1);
    }
private:
    int expandAroundCenter(string& s,int left,int right){
        while(left>=0 && right<s.size() && s[left]==s[right]){
            left--;
            right++;
        }
        return right-left-1;    
    }
};

//方法2：dp
//Runtime: 24.92%
//Memory Usage: 26.7 MB, less than 20.00%
class Solution {
public:
    string longestPalindrome(string s) {
        int n=s.size();
        if(n<=1) return s;
        vector<vector<bool>> dp(n,vector<bool>(n,false));
        string res="";
        res.append(1,s[0]);
        for(int j=0;j<n;j++){
            for(int i=0;i<=j;i++){
                if(s[i]==s[j] && (j-i<=2 || dp[i+1][j-1])){
                    dp[i][j]=true;
                    if(j-i+1>res.size()){
                        res=s.substr(i,j-i+1);
                    }
                }
            }
        }
        return res;
    }
};

参考资料：https://www.cnblogs.com/grandyang/p/4475985.html 

//方法3：马拉车算法
//0 ms, faster than 100.00% 
//9.9 MB, less than 53.79%
class Solution {
public:
    string longestPalindrome(string s) {
        int n=s.size();
        if(n<=1) return s;
        
        string t="$#";
        for(int i=0;i<n;i++){
            t+=s[i];
            t+="#";
        }
        
        vector<int> p(t.size(),0);
        int mx=0,id=0,resLen=0,resCenter=0;
        
        for(int i=1;i<t.size();i++){
            p[i]=mx>i ? min(mx-i,p[2*id-i]) : 1;
            while (t[i+p[i]]==t[i-p[i]]) ++p[i];
            if(mx<p[i]+i){
                mx=p[i]+i;
                id=i;
            }
            if(resLen<p[i]){
                resLen=p[i];
                resCenter=i;
            }
        }
        
        return s.substr((resCenter - resLen) / 2, resLen - 1);
    }
};