题解 | #公共子串计算#

//https://www.nowcoder.com/practice/98dc82c094e043ccb7e0570e5342dd1b?tpId=37&&tqId=21298&sourceUrl=https%3A%2F%2Fwww.nowcoder.com%2Fexam%2Foj

#include <bits/stdc++.h>

using namespace std;

int main() {
    string s1, s2;

    cin >> s1 >> s2;

    int n = s1.size();
    int m = s2.size();

    if (n < m) {
        swap(s1, s2);
        swap(n, m);

    }

    for (int i = m; i >= 0; i--)
        for (int j = 0; j < m - i + 1; j++) {
            string now = s2.substr(j, i);
            if (s1.find(now) != s1.npos) {
                cout << i << endl;
                return 0;
            }

        }
}