字符串的最长重复子串(转)

 1 /*给定出一个字符串，输出最长的重复子字符串*/  
 2 #include <iostream>  
 3 #include <algorithm>  
 4 #include <string>  
 5 using namespace std;  
 6 const int MaxCharNum = 5000000;  
 7   
 8 bool StrCmp(char* str1,char* str2);  
 9 void GenSuffixArray(char* str,char* suffixStr[]);  
10 int ComStrLen(char* str1,char* str2);  
11 void GenMaxReStr(char* str);   
12   
13 int main()  
14 {  
15     char str[MaxCharNum];  
16     cin.getline(str,MaxCharNum);//遇到回车结束  
17     GenMaxReStr(str);  
18     system("pause");  
19     return 1;  
20 }  
21   
22 void GenMaxReStr(char* str)  
23 {  
24     int len = strlen(str);  
25     int comReStrLen = 0;  
26     int maxLoc = 0;  
27     int maxLen = 0;  
28     char* suffixStr[MaxCharNum];  
29     GenSuffixArray(str,suffixStr);//产生后缀数组  
30     //对后缀数组进行排序  
31     sort(suffixStr,suffixStr+len,StrCmp);  
32   
33     //统计相邻单词中相同的字符数，并输出结果  
34     for (int i = 0;i < len-1;i++ )  
35     {  
36         comReStrLen =  ComStrLen(suffixStr[i],suffixStr[i+1]);  
37         if (comReStrLen > maxLen)  
38         {  
39             maxLoc = i;  
40             maxLen = comReStrLen;  
41         }  
42     }  
43     //输出结果  
44     for (int i = 0;i < maxLen;i++)  
45     {  
46         cout<<suffixStr[maxLoc][i];  
47     }  
48     cout<<endl;  
49 }  
50 /*为字符串产生其后缀数组，并存放到数组suffixStr中*/  
51 void GenSuffixArray(char* str,char* suffixStr[])  
52 {  
53     int len = strlen(str);  
54     for (int i = 0;i < len;i++)  
55     {  
56         suffixStr[i] = &str[i];  
57     }  
58 }  
59 /*返回str1和str2的共同前缀的长度*/  
60 int ComStrLen(char* str1,char* str2)  
61 {  
62     int comLen = 0;  
63     while(*str1 && *str2)  
64     {  
65         if (*str1 == *str2)  
66         {  
67             comLen++;  
68         }  
69         str1++;  
70         str2++;  
71     }  
72     return comLen;  
73 }  
74   
75 //字符串升序排序  
76 bool StrCmp(char* str1,char* str2)  
77 {  
78     if (strcmp(str1,str2) >=0 )  
79     {  
80         return false;  
81     }  
82     return true;  
83 }  
84