Longest Symmetric String (25)

题目描述

Given a string, you are supposed to output the length of the longest
symmetric sub-string. For example, given "Is PAT&TAP
symmetric?", the longest symmetric sub-string is "s
PAT&TAP s", hence you must output 11.

输入描述:

Each input file contains one test case which gives a non-empty string of length no more than 1000.

输出描述:

For each test case, simply print the maximum length in a line.

输入例子:

Is PAT&TAP symmetric?

输出例子:

11

我的代码：

（此代码只能在牛客网上通过）

#include
int main()
{
    char a[1001];
    gets(a);
    int i,max=0;
    for(i=0;a[i];i++)
    {
        if(a[i]==a[i+1])
        {
            int x=i,y=i+1,cnt=0;
            while(a[x]==a[y]) cnt++,x--,y++;
            if(cnt*2>max) max=cnt*2;
        }
        else if(a[i-1]==a[i+1])
        {
            int x=i-1,y=i+1,cnt=0;
            while(a[x]==a[y]) cnt++,x--,y++;
            if(cnt*2+1>max) max=cnt*2+1;
        }
    }
    printf("%d\n",max);
    return 0;
}