leetcode 350 Intersection of two arrays II

Problem:

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?

Solution:

1. 如果不排序，O(mn)。 
2. 如果m和n都在合理范围内，先排序，再一个一个对比，时间复杂度O(nlgn + mlgm + m+n)。 
3. 如果m远小于n, 对n排序，m也排序（nlgn+mlgm+m+n），或者m不排序(nlgn + mn)。 这两种都差不多。也可以对m不排序，在n里做binary search，这样复杂度降低为nlgn+mlgn, 降很低。
4. 如果n很大，n只能存在disk上。只能把m load到内存，然后n一个一个的读进来，和m对比，这时m可以用hash存，这样复杂度就为O（n）了。

在博客： http://www.cnblogs.com/qinduanyinghua/p/5527893.html 中给出了几种详细的解决方法，可以参考学习。

下面给出AC 6ms的代码实现，Hash Table;

class Solution {
public:
    vector<int> intersect(vector<int>& nums1, vector<int>& nums2) {
        if(nums1.size()==0 || nums2.size()==0) return vector<int>();
        vector<int> result;
        unordered_map<int, int> hash;
        for(auto val: nums1) hash[val]++;
        for(auto val: nums2)
        {
            if(hash.count(val) && hash[val]>0) result.push_back(val);
            hash[val]--;
        }
        return result;
    }
};