求最大公共子字符串的长度

思路:
矩阵思想,行数位较短的字符串,列数位较长的字符串
#include
#include
#include
using namespace std;
class Mutual {
public:
Mutual(string& s1,string& s2) {
cout << judge(s1, s2) << endl;
}
int judge(string& s1, string& s2) {
string s;
int a = s1.size();
int b = s2.size();
vector<vector> matrix(b+1, vector(a+1, 0));
for (int i = 1; i <= b; i++) {
for (int j = 1; j <= a; j++) {
if (s1[j - 1] == s2[i - 1]) {
matrix[i][j] = matrix[i - 1][j - 1] + 1;
if (matrix[i][j] > s.size())
s = s2.substr(i - matrix[i][j], matrix[i][j]);
}
else matrix[i][j] = 0;
}
}
return s.size();
}
};
int main() {
string s1;
string s2;
while (cin >> s1 >> s2) {
if (s1.size() < s2.size()) swap(s1, s2);
Mutual m1(s1, s2);
}
return 0;
}