leetcode 349 Intersection of Two Arrays C++

这题利用了set里面不能放重复元素的特性来解决

class Solution {public:    vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {        set<int> s;        vector<int> nums3;        for (int i = 0;i<nums1.size();i++){            s.insert(nums1[i]);        }                for (int i = 0;i<nums2.size();i++){            if(s.find(nums2[i]) != s.end()){                s.erase(nums2[i]);                nums3.push_back(nums2[i]);            }        }        return nums3;    }};