[leetcode] 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.

代码：

class Solution {
public:
    vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {
        set<int> result;
        for(vector<int>::iterator i = nums1.begin(); i != nums1.end(); i++){
            for(auto j = nums2.begin(); j != nums2.end(); j++){
                if((*i) == (*j)) result.insert((*i));
            }
        }
        vector<int> r;
        for(set<int>::iterator i = result.begin(); i != result.end(); i++){
            r.push_back((*i));
        }
        return r;
    }
};