add js solution for longestCommonSubsequence

jackeyjia · web-flow · commit c43355deddf9 · 2021-07-14T20:25:38.000-07:00
diff --git a/problems/1143.最长公共子序列.md b/problems/1143.最长公共子序列.md
@@ -197,7 +197,24 @@ func max(a,b int)int  {
 }
 ```
 
+Javascript：
+```javascript
+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])
+            }
+        }
+    }
 
+    return dp[text1.length][text2.length];
+};
+```
 
 
 -----------------------
