【LeetCode】349. Intersection of Two Arrays
程序员文章站
2022-03-23 17:32:13
...
首先,理解题目。题目的要求是求两个数组的交集。
思路:遍历nums1,判断nums2中的数值是否在nums1中存在,存在则输出
【注意题目要求是交集,故而不重复输出】
#include <iostream>
#include <unordered_map>
#include <vector>
using namespace std;
class Solution {
public:
vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {
vector<int> res;
unordered_map<int,int> um;
for(int i = 0; i < nums1.size(); i++){
++um[nums1[i]];
}
for(int i = 0; i < nums2.size(); i++){
int temp = nums2[i];
if(um[temp] > 0){ //if(um.count(temp)){
res.push_back(temp); // res.push_back(temp);
um[temp] = 0; // um[temp]--;
} // } //这种写法为有重复输出
}
return res;
}
};
int main() {
Solution so;
//vector<int>& nums1 = [1,2,2,1];
//vector<int>& nums2 = [2,2];
int m[6] = {1,2,2,1,3,4};
int n[5] = {2,2,1,1,4};
vector<int> a(m, m + 6);
vector<int> b(n, n + 5);
vector<int> res = so.intersection(a,b);
for(int i = 0; i < res.size();i++)
cout << res[i] << endl;
system("pause");
return 0;
}
推荐阅读
-
【LeetCode】4. Median of Two Sorted Arrays
-
LeetCode 4. 两个排序数组的中位数 Median of Two Sorted Arrays
-
LeetCode算法系列:4、Median of Two Sorted Arrays
-
【leetcode】4. Median of Two Sorted Arrays
-
【leetcode阿里题库】4. Median of Two Sorted Arrays
-
[LC] 349. Intersection of Two Arrays
-
349. Intersection of Two Arrays
-
LeetCode刷题笔记(Intersection of Two Arrays II)
-
LeetCode 4. Median of Two Sorted Arrays
-
LeetCode 350. Intersection of Two Arrays II