350. Intersection of Two Arrays II

原题链接：https://leetcode.com/problems/intersection-of-two-arrays-ii/
原题：
Given two arrays, write a function to compute their intersection.

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

Note:
Each element in the result should appear as many times as it shows in both arrays.
The result can be in any order.

Follow up:
What if the given array is already sorted? How would you optimize your algorithm?
What if nums1’s size is small compared to nums2’s size? Which algorithm is better?
What if elements of nums2 are stored on disk, and the memory is limited such that you cannot load all elements into the memory at once?

题意：给你两个数组，要你写一个函数来得出他们的交集数组，交集中元素可以重复，顺序可以随意。
思路：用一个haahmap来储存一个数组中元素出现的次数，然后遍历另一个数组即可。当然也可以对两个数组进行排序后，再比较。这里只贴hash的。

AC代码：

class 
Solution {
public:
    vector<int> intersect(vector<int>& nums1, vector<int>& nums2) {
        vector<int> result;
        unordered_map<int,int> map;
        for(int i=0;i<nums2.size();i++){
            map[nums2[i]]++;
        }
        for(int i=0;i<nums1.size();i++){
            if(map.find(nums1[i])!=map.end()&&map[nums1[i]]!=0) {
                 map[nums1[i]]--;
                 result.push_back(nums1[i]);
            }

        }
        return result;
    }
};