1143.最长公共子序列.js

/*
 * @lc app=leetcode.cn id=1143 lang=javascript
 *
 * [1143] 最长公共子序列
 * 
 * 1. dp 解法
 * 2. 如果当前位置字符相同, 则 dp[i][j] = dp[i - 1][j - 1] + 1;
 * 3. 如果不同, 则 dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]);
 */

// @lc code=start
/**
 * @param {string} text1
 * @param {string} text2
 * @return {number}
 */
var longestCommonSubsequence = function(text1, text2) {
    const dp = [];
    for (let i = 0; i <= text1.length; i++) {
        dp[i] = [];
        for (let j = 0; j <= text2.length; j++) {
            if (i === 0 || j === 0) {
                dp[i][j] = 0;
                continue;
            }

            if (text1[i - 1] === text2[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];
};
// @lc code=end