编辑代码

const longestCommonSubsequence = (text1, text2) => {
  let dp = Array.from(Array(text1.length + 1), () => Array(text2.length + 1).fill(0));

  for (let i = 1; i <= text1.length; i++) {
    for (let j = 1; j <= text2.length; j++) {
      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])
      }
    }
  }
  console.log(dp[text1.length][text2.length])
  return dp[text1.length][text2.length];
};



longestCommonSubsequence("MIGRATION", "MIGRAPION")

longestCommonSubsequence("Fish", "Hist")