leetcode两个字符串的删除操作【动态规划思想】

 
 let word1 = "sea", word2 = "eat"
 function name() {
   const m = word1.length,
     n = word2.length;
   const dp = new Array(m + 1).fill(0).map(() => new Array(n + 1).fill(0));
   for (let i = 1; i <= m; i++) {
     const c1 = word1[i - 1];
     for (let j = 1; j <= n; j++) {
       const c2 = word2[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]);
       }
     }
   }
   //动态规划思想 但不是完全的动态规划 但这是时间复杂度较少
   const lcs = dp[m][n];
   return m - lcs + n - lcs;
 };

console.log(name());