力扣[LeetCode].350. 两个数组的交集 II

class Solution {
    
    
public:
    vector<int> intersect(vector<int>& nums1, vector<int>& nums2) {
    
    
        unordered_multiset<int> S;
        for(auto x:nums1) S.insert(x);
        vector<int> res;
        for(auto x:nums2)
            if(S.count(x)){
    
    
                res.push_back(x);
                S.erase(S.find(x));
            }
        return res;
    }
};