java 两个字符串,求最长公共子串的长度

Question

如题所述

Answer 1

用动态规划，
if (s1[i] == s2[j])
dp[i][j] = dp[i - 1][j - 1] + 1;

else
dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);