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].

class Solution {
public:
    vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {
        unordered_set<int> m(nums1.begin(),nums1.end());
        vector<int> ans;
        for(auto i:nums2){
            if(m.erase(i)){
                ans.push_back(i);
            }
        }
        return ans;
    }
};