GEEK编程练习— —连续出现最多子串

题目

abcbcbcabc

bc
3

解析

代码

#include <iostream>
#include <string>

using namespace std;

int main()
{
string str;
cin >> str;

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 << endl << maxCount << endl;
return 0;

}