#include <iostream>
#include <string>
using namespace std;
void main(){
string str = "abcabcabcccccdefefefefefef";
int len = str.length();
int maxCount = 0;
string longest = "";
for(int pos1 = 0; pos1 < len; pos1++)
for(int pos2 = pos1 + 1; pos2 < len; pos2++){
if(str.substr(pos1,pos2-pos1) == str.substr(pos2,pos2-pos1)){
int offset = pos2-pos1;
int count = 2;
for(int k = pos2 + offset; k <= len; k += offset){
if(str.substr(pos1,offset) == str.substr(k,offset)){
count += 1;
}else{
break;
}
}
if(count > maxCount){
maxCount = count;
longest = str.substr(pos1,offset);
}
}
}
cout << longest << "," << maxCount << endl;
}
求一个字符串中连续出现次数最多的子串
最新推荐文章于 2019-09-01 09:36:00 发布