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 num2'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?

class Solution {
public:
    vector<int> intersect(vector<int>& nums1, vector<int>& nums2) {
        map<int,int> shortSet;
        vector<int> returnSet;
        
        if(nums1.size() > nums2.size()){
            vector<int> tmp = nums1;
            nums1 = nums2;
            nums2 = tmp;
        }
        
        for(auto i = nums1.begin(); i != nums1.end(); i++){
            if(shortSet[*i] > 0) shortSet[*i] = shortSet[*i] + 1;
            else shortSet[*i] = 1;
        }
        for(auto i = nums2.begin(); i != nums2.end(); i++){
            if(shortSet[*i] > 0){
                returnSet.push_back(*i);
                shortSet[*i] = shortSet[*i] - 1;
            }
        }
        return returnSet;
    }
};