From 139761a07729b450bad3ac9b4ee50ff1337c575e Mon Sep 17 00:00:00 2001
From: "qingyi.liu" <qingyival@163.com>
Date: Sat, 22 May 2021 10:30:01 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0349.=20=E4=B8=A4=E4=B8=AA?=
 =?UTF-8?q?=E6=95=B0=E7=BB=84=E7=9A=84=E4=BA=A4=E9=9B=86JavaScript?=
 =?UTF-8?q?=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0349.两个数组的交集.md | 28 ++++++++++++++++++++++++++
 1 file changed, 28 insertions(+)

diff --git a/problems/0349.两个数组的交集.md b/problems/0349.两个数组的交集.md
index b5116ee1..93d2c2d4 100644
--- a/problems/0349.两个数组的交集.md
+++ b/problems/0349.两个数组的交集.md
@@ -113,6 +113,34 @@ Python：
 
 Go：
 
+javaScript:
+
+```js
+/**
+ * @param {number[]} nums1
+ * @param {number[]} nums2
+ * @return {number[]}
+ */
+var intersection = function(nums1, nums2) {
+    // 根据数组大小交换操作的数组
+    if(nums1.length < nums2.length) {
+        const _ = nums1;
+        nums1 = nums2;
+        nums2 = _;
+    }
+    const nums1Set = new Set(nums1);
+    const resSet = new Set();
+    // for(const n of nums2) {
+    //     nums1Set.has(n) && resSet.add(n);
+    // }
+    // 循环 比 迭代器快
+    for(let i = nums2.length - 1; i >= 0; i--) {
+        nums1Set.has(nums2[i]) && resSet.add(nums2[i]);
+    }
+    return Array.from(resSet);
+};
+```
+