Given two arrays, write a function to compute their intersection.
Example:
Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2].
Note:
- Each element in the result must be unique.
- The result can be in any order.
class Solution {
public:
vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {
int record1[10000]={};
vector<int>vec;
for(vector<int>::iterator iter=nums1.begin();iter!=nums1.end();iter++){
record1[*iter]+=1;
}
for(vector<int>::iterator iter=nums2.begin();iter!=nums2.end();iter++){
if(record1[*iter]!=0){
vec.push_back(*iter);
record1[*iter]=0;
}
}
return vec;
}
};