leetcode-350-两个数组的交集II
class Solution {
public:
vector<int> intersect(vector<int>& nums1, vector<int>& nums2) {
map<int, int> record;
vector<int> res;
int N1 = nums1.size(), N2 = nums2.size();
for(int i =0; i<N1; i++){
record[nums1[i]]++;
}
for (int i=0; i<N2; i++){
if (record[nums2[i]] > 0){
res.push_back(nums2[i]);
record[nums2[i]]--;
}
}
return res;
}
};