题解 | 公共子串计算

#include <iostream>
using namespace std;

int main() {
    string a, b;

    while (cin >> a >> b) {
        if (a.size() > b.size()) swap(a, b);
        int maxLen = 0;
        for (int i = 0; i < a.size(); i++) {
            for (int j = 0; j <= a.size() - i; j++) {
                string subStr = a.substr(i, j);
                if (b.find(subStr) != string::npos && subStr.size() > maxLen)
                    maxLen = subStr.size();
            }
        }

        cout << maxLen << endl;
    }
}