法1:动态规划
看了题解
推荐去看 力扣 的该题题解
想法:
- 创建数组dp:dp[i][j]保存text1前i个、text2前j个字符中的两者的最长公共子序列;dp[0][j]和dp[i][0]均为0,因为此时表示text1或text2取空字符串时
/**
* @param {string} text1
* @param {string} text2
* @return {number}
*/
var longestCommonSubsequence = function(text1, text2) {
var dp = [];
var i = 0, j = 0;
for(i = 0; i <= text1.length; i++) {
dp[i] = [];
}
for(i = 0; i <= text1.length; i++) {
for(j = 0; j <= text2.length; j++) {
if(i == 0) {
dp[i][j] = 0;
continue;
}
if(j == 0) {
dp[i][j] = 0;
continue;
}
if(text1.charAt(i - 1) == text2.charAt(j - 1)) {
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[text1.length][text2.length];
};