From 0b643bd27d71a2472ee1cf0bfa16cd7f99df0a4b Mon Sep 17 00:00:00 2001
From: Steve2020 <841532108@qq.com>
Date: Thu, 13 Jan 2022 15:00:39 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=EF=BC=880349.=E4=B8=A4?=
 =?UTF-8?q?=E4=B8=AA=E6=95=B0=E7=BB=84=E7=9A=84=E4=BA=A4=E9=9B=86.md?=
 =?UTF-8?q?=EF=BC=89=EF=BC=9A=E5=A2=9E=E5=8A=A0typescript=E7=89=88?=
 =?UTF-8?q?=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

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

diff --git a/problems/0349.两个数组的交集.md b/problems/0349.两个数组的交集.md
index 812c4489..92342f17 100644
--- a/problems/0349.两个数组的交集.md
+++ b/problems/0349.两个数组的交集.md
@@ -190,7 +190,33 @@ var intersection = function(nums1, nums2) {
 };
 ```
 
+TypeScript:
+
+版本一（正常解法）：
+
+```typescript
+function intersection(nums1: number[], nums2: number[]): number[] {
+    let resSet: Set<number> = new Set(),
+        nums1Set: Set<number> = new Set(nums1);
+    for (let i of nums2) {
+        if (nums1Set.has(i)) {
+            resSet.add(i);
+        }
+    }
+    return Array.from(resSet);
+};
+```
+
+版本二（秀操作）：
+
+```typescript
+function intersection(nums1: number[], nums2: number[]): number[] {
+    return Array.from(new Set(nums1.filter(i => nums2.includes(i))))
+};
+```
+
 Swift：
+
 ```swift
 func intersection(_ nums1: [Int], _ nums2: [Int]) -> [Int] {
     var set1 = Set<Int>()