如何使用C++找到最长公共子串

#include <iostream>
#include <string>
using namespace std;

bool isCommonSubstr(string s, string t) {
    int m = s.length(), n = t.length();
    bool dp[m+1][n+1];
    memset(dp, false, sizeof(dp));
    dp[0][0] = true;
    for (int i = 0; i <= m; i++) {
        for (int j = 0; j <= n; j++) {
            if (i == 0 && j == 0) {
                continue;
            }
            if (s[i-1] == t[j-1]) {
                dp[i][j] = dp[i-1][j-1] || dp[i-1][j];
            } else {
                dp[i][j] = false;
            }
        }
    }
    return dp[m][n];
}

int main() {
    string s = "abcde";
    string t = "bcdef";
    if (isCommonSubstr(s, t)) {
        cout << "最长公共子串是: " << s.substr(0, t.length()) << endl;
    } else {
        cout << "没有找到公共子串" << endl;
    }
    return 0;
}