leetcode Algorithms 5. Longest Palindromic Substring

题意：找最长回文串；

思路：马拉车算法；

class Solution
{
public:
    string s;
    char str[2010];
    int p[2010];
    void manacher(string s,int l)
    {
        int i,j,k,ans=0;
        for(i=1,j=0; i<=l; ++i,j++)str[i<<1]=s[j],str[(i<<1)+1]='#';
        str[1]='#';
        str[l*2+1]='#';
        str[0]='&';
        str[l*2+2]='$';
        l=l*2+1;
        j=0;
        for(i=1; i<=l;)
        {
            while(str[i-j-1]==str[i+j+1])++j;
            p[i]=j;
            if(j>ans)ans=j;
            for(k=1; k<=j&&p[i]-k!=p[i-k]; ++k)p[i+k]=min(p[i-k],p[i]-k);
            i+=k;
            j=max(j-k,0);
        }
    }
    string longestPalindrome(string s) {
        manacher(s,s.size());
        int x=s.size();
        x=x*2+1;
        int pos=0,maxx=0;
        for(int i=1;i<=x;i+=1)
            if(p[i]>=maxx)maxx=p[i],pos=i;
        string ans="";
        for(int i=(pos+1)/2-1-maxx/2;i<=pos/2-1+maxx/2;i++)
            ans+=s[i];
        return ans;
    }
};