给定两个字符串,求他们的最长公共子序列
s="abcd";
t="bcde";
如果s[i]==t[j]
那么dp[i+1][j+1]=max(dp[i][j]+1,dp[i+1][j].dp[i][j+1]);
如果不等
dp[i+1][j+1]=max(dp[i+1][j].dp[i][j+1]);
for (int i = 0; i < n; i++) {
for (int j = 0; j <= m; j++) {
if (s[i] == t[j]) {
dp[i + 1][j + 1] = max(dp[i][j] + 1, dp[i][j + 1], dp[i + 1][j]);
}
else {
dp[i + 1][j + 1] = max(dp[i][j + 1], dp[i + 1][j]);
}
}
}