最长回文子串

#include<stdio.h>
#include<string.h>
char* longestPalindrome(char* s)
{
    int i=0,k,flag,max=0,t,p,t1,maxlength;
    int len=strlen(s);
    k=len-1;
    if(k==0)
    {
      p=0;
      maxlength=1;
    }
    while(i<=k&&k!=0)
   {
      flag=1,t1=k;
      while(s[i]!=s[k])
      {
          k--;
      }
      if(i==k)
      {
          i++;
          k=t1-1;
      }
      else
      {
          p=i;
          while(i<k&&flag)
          {
              if(s[i]==s[k-i])
              {
                  i++;
              }
              else flag=0;
          }
          if(i<k)
            break;
          else
          {
              if((k-p+1)>max)max=k;
              maxlength=max-p+1;
          }
      }
  }
		char *arr = (char *)malloc(sizeof(int) * (max* 2));
		for (i=0; i<maxlength; i++)
		{
			arr[i] = s[p++];
		}
		arr[i] = '\0';
		for (i=0; i<maxlength; i++)
		{
			printf("%c",arr[i]);
		}
}
int main()
{
    char s[20],s1[20];
    int i;
    while(1)
    {
        scanf("%s",&s);
        longestPalindrome(s);
        printf("\n");
    }
    return 0;
}