两个数组的交集(leetcode349)c++
https://leetcode-cn.com/problems/intersection-of-two-arrays/
class Solution {
public:
vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {
int count=0;
set<int>st(nums1.begin(),nums1.end());
for(auto num:nums2){
if(st.erase(num)==true){//
nums2[count]=num;
count++;
}
}
return vector<int>(nums2.begin(),nums2.begin()+count);
}
};