编辑代码

function longestCommonSubsequence(s1, s2) {
  let m = s1.length;
  let n = s2.length;

  let dp = new Array(m + 1);
  for (let i = 0; i <= m; i++) {
    dp[i] = new Array(n + 1).fill(0);
  }

  for (let i = 1; i <= m; i++) {
    for (let j = 1; j <= n; j++) {
      if (s1[i - 1] === s2[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[m][n];
}

let s1 = "abcd";
let s2 = "acdf";
let length = longestCommonSubsequence(s1, s2);
console.log("Length of Longest Common Subsequence:", length);