LeetCode 349 Intersection of Two Arrays

用set排重

class Solution {public:    vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {        set<int> myset1, myset2;        for (int i = 0; i < nums1.size(); i++) {            myset1.insert(nums1[i]);        }        for (int i = 0; i < nums2.size(); i++) {            myset2.insert(nums2[i]);        }        vector<int> ans;        for (set<int>::iterator it = myset1.begin(); it != myset1.end(); it++) {            if (myset2.count(*it)) {                ans.push_back(*it);               }        }        return ans;    }};