From 152f7cc61a8e5891374b14c0ac998995fe3da767 Mon Sep 17 00:00:00 2001
From: Jack <965555169@qq.com>
Date: Tue, 3 Aug 2021 08:45:05 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A01035.=E4=B8=8D=E7=9B=B8?=
 =?UTF-8?q?=E4=BA=A4=E7=9A=84=E7=BA=BF-JavaScript=E7=89=88?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/1035.不相交的线.md | 23 ++++++++++++++++++++++-
 1 file changed, 22 insertions(+), 1 deletion(-)

diff --git a/problems/1035.不相交的线.md b/problems/1035.不相交的线.md
index cb74ef75..3a0e6a68 100644
--- a/problems/1035.不相交的线.md
+++ b/problems/1035.不相交的线.md
@@ -109,7 +109,28 @@ class Solution:
         return dp[-1][-1]
 ```
 
-Go：
+JavaScript：
+
+```javascript
+const maxUncrossedLines = (nums1, nums2) => {
+    // 两个数组长度
+    const [m, n] = [nums1.length, nums2.length];
+    // 创建dp数组并都初始化为0
+    const dp = new Array(m + 1).fill(0).map(x => new Array(n + 1).fill(0));
+    for (let i = 1; i <= m; i++) {
+        for (let j = 1; j <= n; j++) {
+            // 根据两种情况更新dp[i][j]
+            if (nums1[i - 1] === nums2[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]);
+            }
+        }
+    }
+    // 返回dp数组中右下角的元素
+    return dp[m][n];
+};
+```