algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-06 23:28:29 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update

Browse Source
This commit is contained in:
youngyangyang04
2020-07-02 09:42:03 +08:00
parent 7201721352
commit 1a3fe9539f
1 changed files with 5 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
problems/0349.两个数组的交集.md
View File

@ -11,14 +11,15 @@ https://leetcode-cn.com/problems/intersection-of-two-arrays/
class Solution { class Solution {
public: public:
vector<int> intersection(vector<int>& nums1, vector<int>& nums2) { 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()); unordered_set<int> nums_set(nums1.begin(), nums1.end());
for (int num : nums2) { for (int num : nums2) {
if (nums_set.find(num) != nums_set.end()) { // 发现nums1与nums2有重复 // 发现nums2的元素 在nums_set里又出现过
set.insert(num); 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());
} }
}; };
``` ```