leetcode 最长回文子串

1.可用求字符串和其逆序字符串的最长公共子串的方式求解。

2.还需改进，防止“aacfcaa”这种情况出现。只需要在更新max之前判断两个字符串的起始位置的索引是否相同，即下标和为母串长度。

class Solution {


public:
    string longestPalindrome(string s) {
        if(s.length()==0)return "";
        string str1=s;
        string str2(s.rbegin(),s.rend());
        int i,k=0,len1,len2,len,s1_start,s2_start,idx,curmax,max=0;
        len1 = str1.length();
        len2 = str2.length();
        len = len1 + len2;
        max = 0;
        for(i = 0 ; i < len ; i++)
        {
            s1_start = s2_start = 0;
            if(i < len1)
                s1_start = len1 - i;    //每次开始匹配的起始位置
            else
                s2_start = i - len1;
            curmax = 0;
            for(idx = 0 ; ( s1_start + idx < len1 ) && ( s2_start + idx < len2 ); idx++ )
            {
                if(str1[s1_start+idx]==str2[s2_start+idx])
                    curmax++;
                else     //只要有一个不相等，就说明相等的公共字符断了，不连续了，要保存curmax与max中的最大值，并将curmax重置为0
                {
                    //max = curmax > max ? curmax : max;
                    if(curmax > max&&s1_start+idx+s2_start+idx-curmax==len1)
                    {
                        cout<<s1_start+idx<<" "<<s2_start+idx<<endl;
                        max = curmax;
                        k = s1_start+idx-1;      //保存连续子串长度增加时连续子串最后一个字符在str1字符串中的下标位置，便于输出公共连续子串
                    }
                    curmax = 0;
                }
            }
            //max = curmax > max ? curmax : max;

            if(curmax > max&&s1_start+idx+s2_start+idx-curmax==len1)
            {
                cout<<s1_start+idx<<" "<<s2_start+idx<<endl;
                max = curmax;
                k = s1_start+idx-1;
            }
        }

        //输出公共子串
        cout<<max<<" "<<k<<endl;
        string ans(s,k-max+1,max);
        return ans;
        
   }
};