From c8ef172319234d388730cc835dbd9214c48ea82c Mon Sep 17 00:00:00 2001
From: Minxi Yan <77104028+Yan0613@users.noreply.github.com>
Date: Mon, 20 May 2024 13:53:15 +0800
Subject: [PATCH] =?UTF-8?q?Update=200454.=E5=9B=9B=E6=95=B0=E7=9B=B8?=
 =?UTF-8?q?=E5=8A=A0II.md=EF=BC=8C=E4=BF=AE=E6=94=B9=E5=9B=9B=E6=95=B0?=
 =?UTF-8?q?=E7=9B=B8=E5=8A=A0IIGo=E7=89=88=E6=9C=AC=E7=9A=84=E8=A7=A3?=
 =?UTF-8?q?=E7=AD=94=E4=BB=A3=E7=A0=81?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

修改四数相加IIGo版本的解答代码，修改原版代码中的逻辑问题，使其通过leetcode的代码测试。
---
 problems/0454.四数相加II.md | 36 +++++++++++++++++++--------------
 1 file changed, 21 insertions(+), 15 deletions(-)

diff --git a/problems/0454.四数相加II.md b/problems/0454.四数相加II.md
index db9a9e43..b73901f8 100644
--- a/problems/0454.四数相加II.md
+++ b/problems/0454.四数相加II.md
@@ -185,22 +185,28 @@ class Solution:
 ### Go：
 
 ```go
-func fourSumCount(nums1 []int, nums2 []int, nums3 []int, nums4 []int) int {
-    m := make(map[int]int)   //key:a+b的数值，value:a+b数值出现的次数
-    count := 0
-     // 遍历nums1和nums2数组，统计两个数组元素之和，和出现的次数，放到map中
+func fourSumCount(nums1 []int, nums2 []int, nums3 []int, nums4 []int) int {  
+    m := make(map[int]int)  
+    count := 0  
+  
+    // 构建nums1和nums2的和的map  
     for _, v1 := range nums1 {  
-        for _, v2 := range nums2 {
-            m[v1+v2]++
-        }
-    }
-    // 遍历nums3和nums4数组，找到如果 0-(c+d) 在map中出现过的话，就把map中key对应的value也就是出现次数统计出来
-    for _, v3 := range nums3 {
-        for _, v4 := range nums4 {
-            count += m[-v3-v4]
-        }
-    }
-    return count
+        for _, v2 := range nums2 {  
+            m[v1+v2]++  
+        }  
+    }  
+  
+    // 遍历nums3和nums4，检查-c-d是否在map中  
+    for _, v3 := range nums3 {  
+        for _, v4 := range nums4 {  
+            sum := -v3 - v4  
+            if countVal, ok := m[sum]; ok {  
+                count += countVal  
+            }  
+        }  
+    }  
+  
+    return count  
 }
 ```