1143.最长公共子序列

Author: cslc-ubm

1143. 最长公共子序列.js

@@ -0,0 +1,28 @@
+/**
+ * 动态规划算法之 -- 最长公共子序列
+ * @param {string} text1
+ * @param {string} text2
+ * @return {number}
+ */
+var longestCommonSubsequence = function (text1, text2) {
+  let m = text1.length
+  let n = text2.length
+  let dp = Array.from(new Array(m + 1), () => new Array(n + 1).fill(0))
+
+  for (let i = 0; i < m; i++) {
+    for (let j = 0; j < n; j++) {
+      if (text1[i] === text2[j]) {
+        dp[i + 1][j + 1] = dp[i][j] + 1
+      } else {
+        dp[i + 1][j + 1] = Math.max(dp[i + 1][j], dp[i][j + 1])
+      }
+    }
+  }
+  return dp[m][n]
+}
+
+let lcs = longestCommonSubsequence('abc', 'acbd')
+// let lcs = longestCommonSubsequence("ezupkr", "ubmrapg")
+// let lcs = longestCommonSubsequence("bsbininm", "jmjkbkjkv")
+
+console.log('lcs: ', lcs)