349. Intersection of Two Arrays

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.

思路：利用set获得无重复数组

代码1：

class Solution {
public:
    vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {
         unordered_set<int> m(nums1.begin(), nums1.end());
        vector<int> res;
        for (auto a : nums2)
            if (m.count(a)) {
                res.push_back(a);
                m.erase(a);
            }
        return res;
    }
};

代码2：

class Solution {
public:
    vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {
        set<int> n1,n2;
        vector<int> res;
        for(int i:nums1){n1.insert(i);}
        for(int i:nums2){n2.insert(i);}
        for(int i:n1){
            if(n2.count(i)){res.push_back(i);}
        }
        return res;
    }
};

代码3：

class Solution {
public:
    vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {
        unordered_set<int> set;
        for (int n:nums1) {
            set.insert(n);
        }
        
        vector<int> results;
        for (int n:nums2) {
            if (set.find(n) != set.end()) {
                results.push_back(n);
                set.erase(n);//key
            }
        }
        
        return results;
    }
};