百炼OJ 2744找相同子串

 1 char str[100][101];
 2 int FindMaxSameSubString(const char *s, int n){
 3     int sourceLen = strlen(s);   
 4     int subLen = strlen(s);
 5     char subStr[101];          //保存最小子串
 6     char revsubStr[101];     //保存最小字串的反串
 7     while(subLen > 0){       //从最大的子串开始找
 8         for(int i = 0; i <= sourceLen - subLen; ++i){    //枚举所有子串
 9             strncpy(subStr, s + i , subLen);
10             strncpy(revsubStr, s + i , subLen);
11             subStr[subLen] = revsubStr[subLen] = '\0';
12             strrev(revsubStr);
13             bool find = true;
14             for(int j = 0; j != n; ++j){     //和全局数组进行比较
15                 if(strstr(str[j],subStr) == NULL && strstr(str[j] ,revsubStr) == NULL){
16                     find = false;     //不满足就结束本次循环
17                     break;
18                 }
19             }
20             if (find) return(subLen);
21         }
22         subLen --;         //子串长度减小，继续在剩余的子串中找
23     }
24     return 0;
25 }