Create 1143-longest-common-subsequence.js

Author: everthis

1143-longest-common-subsequence.js

@@ -0,0 +1,17 @@
+/**
+ * @param {string} text1
+ * @param {string} text2
+ * @return {number}
+ */
+const longestCommonSubsequence = function(text1, text2) {
+  let dp = new Array(text1.length + 1)
+  for (let i = 0; i < dp.length; i++)
+    dp[i] = new Array(text2.length + 1).fill(0)
+  for (let i = 1; i < dp.length; i++) {
+    for (let j = 1; j < dp[i].length; j++) {
+      if (text1[i - 1] == text2[j - 1]) dp[i][j] = 1 + dp[i - 1][j - 1]
+      else dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1])
+    }
+  }
+  return dp[dp.length - 1].pop()
+}