题解 | 查找两个字符串a,b中的最长公共子串

#include <iostream>
using namespace std;

int main() {
    string a, b;

    while (cin >> a >> b) {
        string minStr = "";

        // 如果 a的是长字符串就 交互 确保 a 是短的字符串
        if (a.size() > b.size())
            swap(a, b);

        for (int i = 0; i < a.size(); i++) {
            for (int j = 1; j < a.size(); j++) {
                string subStr = a.substr(i, j);

                if (b.find(subStr) != string::npos  && subStr.size() > minStr.size())
                    minStr = subStr;

            }
        }

        cout << minStr << endl;

    }
}