题目
求一个字符串中连续出现次数最多的子串
如果字符串是abcbcbcabc,这个连续出现次数最多的子串是bc,连续出现次数为3次。如果类似于abcccabc,则连续出现次数最多的子串为c,次数也是3次。
输入
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;
}