题目:
思路解析:
可以画个二维表,使用动态规划的思路,这时候很容易就能够得出状态转移方程:
dp[i][j] = dp[i-1][j-1] c1==c2;
dp[i][j] = max{dp[i-1][j],dp[i][j-1]} c1!=c2;
(其中c1和c2是分别指向两个字符串中的字符)
答案:
class Solution {
public int longestCommonSubsequence(String text1, String text2) {
int m = text1.length(), n = text2.length();
int[][] dp = new int[m + 1][n + 1];
for (int i = 1; i <= m; i++) {
char c1 = text1.charAt(i - 1);
for (int j = 1; j <= n; j++) {
char c2 = text2.charAt(j - 1);
if (c1 == c2) {
dp[i][j] = dp[i - 1][j - 1] + 1;
} else {
dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]);
}
}
}
return dp[m][n];
}
}