题解 | #最长回文子串#

#include<stdio.h>
#include<string.h>
int main()
{
    char str[1000];
    while(scanf("%s",&str)!=EOF)
    {
        int len=strlen(str);
        int i,k;
        int max;
        int sum,sum1;
        max=0;
        for(i=0;i<len;i++)
        {
           sum=0;
           if (str[i]==str[i+1])//abba型
           {
               for(k=0;k<len;k++)
                {
                    if(str[i-k]==str[i+k+1]&&i-k>=0&&i+k-1<len)
                    {
                        sum=sum+1;
                    }
                    else
                        break;
                   max=fmax(max,sum*2);
                }
           }
            else if (str[i-1]==str[i+1])//aba型
            {
                sum1=0;
                for(k=0;k<len;k++)
                {
                    if(str[i-k-1]==str[i+k+1]&&i-k-1>=0&&i+k+1<len)
                    {
                        sum1=sum1+1;
                    }
                    else
                        break;
                    max=fmax(max,sum1*2+1);
                }
            }
        }
        printf("%d",max);
    }
    return 0;
}