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.

使用STL中的set，简单粗暴。

class Solution {
public:
    vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {
        set<int> s;
        for( int i = 0; i < nums1.size(); i++ ) {
            if( find( nums2.begin(), nums2.end(), nums1[i] ) != nums2.end() ) {
                s.insert( nums1[i] );
            }
        }
        vector<int> vec;
        set<int>::iterator it; //定义前向迭代器 
        for( it = s.begin(); it != s.end(); it++ ) {
            vec.push_back( *it );
        }
        return vec;
    }
};