From 1a3fe9539fbabf94c6712f624a2e16b1953a7f93 Mon Sep 17 00:00:00 2001
From: youngyangyang04 <826123027@qq.com>
Date: Thu, 2 Jul 2020 09:42:03 +0800
Subject: [PATCH] Update

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

diff --git a/problems/0349.两个数组的交集.md b/problems/0349.两个数组的交集.md
index e30b7ae2..06cabc67 100644
--- a/problems/0349.两个数组的交集.md
+++ b/problems/0349.两个数组的交集.md
@@ -11,14 +11,15 @@ https://leetcode-cn.com/problems/intersection-of-two-arrays/
 class Solution {
 public:
     vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {
-        unordered_set<int> set; // 存放结果
+        unordered_set<int> result_set; // 存放结果
         unordered_set<int> nums_set(nums1.begin(), nums1.end());
         for (int num : nums2) {
-            if (nums_set.find(num) != nums_set.end()) { // 发现nums1与nums2有重复
-                set.insert(num);
+            // 发现nums2的元素 在nums_set里又出现过
+            if (nums_set.find(num) != nums_set.end()) {
+                result_set.insert(num);
             }
         }
-        return vector<int>(set.begin(), set.end());
+        return vector<int>(result_set.begin(), result_set.end());
     }
 };
 ```