From ac58e6613bd6a9d3e265e95e285c40b05bbc6f29 Mon Sep 17 00:00:00 2001
From: Yuhao Ju <juguaguaji@gmail.com>
Date: Thu, 24 Nov 2022 21:26:09 +0800
Subject: [PATCH] =?UTF-8?q?update=200349.=E4=B8=A4=E4=B8=AA=E6=95=B0?=
 =?UTF-8?q?=E7=BB=84=E7=9A=84=E4=BA=A4=E9=9B=86=20=E4=BF=AE=E6=94=B9python?=
 =?UTF-8?q?=E4=BB=A3=E7=A0=81=EF=BC=8C=E5=88=A0=E9=99=A4=E5=86=97=E4=BD=99?=
 =?UTF-8?q?=E7=9A=84go=E4=BB=A3=E7=A0=81?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

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

diff --git a/problems/0349.两个数组的交集.md b/problems/0349.两个数组的交集.md
index bd83fae9..2e98ef6f 100644
--- a/problems/0349.两个数组的交集.md
+++ b/problems/0349.两个数组的交集.md
@@ -147,32 +147,24 @@ Python3：
 ```python
 class Solution:
     def intersection(self, nums1: List[int], nums2: List[int]) -> List[int]:
-        return list(set(nums1) & set(nums2))    # 两个数组先变成集合，求交集后还原为数组
+        val_dict = {}
+        ans = []
+        for num in nums1:
+            val_dict[num] = 1
+
+        for num in nums2:
+            if num in val_dict.keys() and val_dict[num] == 1:
+                ans.append(num)
+                val_dict[num] = 0
+        
+        return ans
 ```
 
 
 Go：
 ```go
 func intersection(nums1 []int, nums2 []int) []int {
-    m := make(map[int]int)
-    for _, v := range nums1 {
-        m[v] = 1
-    }
-    var res []int
-    // 利用count>0，实现重复值只拿一次放入返回结果中
-    for _, v := range nums2 {
-        if count, ok := m[v]; ok && count > 0 {
-            res = append(res, v)
-            m[v]--
-        }
-    }
-    return res
-}
-```
-```golang
-//优化版，利用set，减少count统计
-func intersection(nums1 []int, nums2 []int) []int {
-    set:=make(map[int]struct{},0)
+    set:=make(map[int]struct{},0)  // 用map模拟set
     res:=make([]int,0)
     for _,v:=range nums1{
         if _,ok:=set[v];!ok{