给定两个字符串A,B(只包含26个英文字母),输出所有公共的最长子字符串(如果出现重复子串,则输出多次)
输入包括两行,每行为一个连续字符串(大小写敏感)
输出包括多行,每行为扫描到的最长公共子串,按照该子串在字符串A(即第一行输入字符串)中出现的先后次序输出
样例输入:
abcxyzabcrst
opqrstabc
样例输出:
abc
rst
#include<iostream>
#include<string>
#include<vector>
using namespace std;
int main()
{
string str1;
string str2;
cin >> str1 >> str2;
vector<string>vec;
int cur = 0;
int first = 0;
int last = 0;
bool flag = false;
int i = 0;
while (i < str1.length())
{
cur = i;
for (int j = 0; j <= str2.length(); ++j)
{
if (j < str2.length() && str1[cur] == str2[j])
{
cur++;
if (!flag)
{
last = first = j;
flag = true;
}
else
{
last++;
}
}
else
{
if (flag)
{
string substr = str2.substr(first, last - first + 1);
if (vec.size() == 0)
{
vec.push_back(substr);
}
else
{
if (vec.back().length() < substr.length())
{
vec.clear();
vec.push_back(substr);
}
else if (vec.back().length() == substr.length())
{
vec.push_back(substr);
}
}
flag = false;
for (int k = first; k < last; ++k)
{
str2[k] = '#';
}
}
cur = i;
}
}
i += (last - first + 1);
}
for (int i = 0; i < vec.size(); ++i)
{
cout << vec[i] << endl;
}
return 0;
}
结果如下: