题解 | #公共子串计算#C++暴力

#include<iostream>
using namespace std;


int main ()
{
    string s1, s2;
    getline(cin, s1);
    getline(cin, s2);

    int maxS = 0;

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

    for (int i = 0; i < m; i++)
    {

        for (int j = 0; j < n; j++)
        {

            if (s2[j] == s1[i])
            {
                int maxTemp = 0;
                int a = i, b = j;
                for ( ; a < m && b < n; a++, b++)
                {

                    if (s1[a] != s2[b])
                        break;
                    maxTemp++;
                }
                if (maxTemp > maxS)
                    maxS = maxTemp;
            }

        }

    }


    cout << maxS;
    return 0;
}