sort算法案例

题目：

Given two arrays, write a function to compute their intersection.

Example:
Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2].

Note:

• Each element in the result must be unique.
• The result can be in any order.

代码：

class Solution {
public:
    vector intersection(vector& nums1, vector& nums2) {
        unordered_set m(nums1.begin(), nums1.end());
        vector res;
        for (auto a : nums2)
            if (m.count(a)) {
                res.push_back(a);
                m.erase(a);
            }
        return res;
    }
};