求最长回文子串（不足：时间复杂度较高）

/***************************************************** copyright (C), 2014-2015, Lighting Studio. Co.,     Ltd.  File name： Author：Jerey_Jobs    Version:0.1    Date:  Description： Funcion List:  *****************************************************/ #include <stdio.h> #include <string.h> int main() {     char A[100]; int count = 0; int len = 0; int maxlen = 0; int i = 0; int j = 0;     int t1; int t2; printf("please enter a string:\n");     fgets(A,100,stdin); printf("the length of string is:%d\n",strlen(A)-1); len = strlen(A)-1;     for ( i = 0 ; i < len ; i++) { for( j = i + 1;j <len ; j++) { for(t1=i,t2=j;t1<t2;t1++,t2--) { if(A[t1]!=A[t2]) break; } if(t1>=t2 && j-i+1>maxlen) { maxlen = j-i+1; printf("****\n"); } } } printf("the max manacher is:%d\n",maxlen);     return 0; }