Code & Func

第78天。

又是hash,为什么每次都随机到hash.

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?

和昨天的解法有点想,先遍历一个数组，用hash table进行计数，然后再遍历第二个数组，然后实时的更新hash table就好了：

1
vector<int> intersec1t(vector<int>& nums1, vector<int>& nums2) {
2
    unordered_map<int,int> m;
3
    for(auto i:nums1) m[i]++;
4
    vector<int> ret;
5
    for(auto i:nums2) {
6
        if (m[i] != 0) {
7
            ret.push_back(i);
8
            m[i]--;
9
        }
10
    }
11
    return ret;
12
}

还有就是可以用sort来做：

1
vector<int> intersect(vector<int>& nums1, vector<int>& nums2) {
2
    sort(nums1.begin(),nums1.end());
3
    sort(nums2.begin(),nums2.end());
4
    int i1,i2;
5
    vector<int> ret;
6
    for(i1=0,i2=0;i1 < nums1.size() && i2 < nums2.size();) {
7
        if (nums1[i1] == nums2[i2]) {
8
            ret.push_back(nums1[i1]);
9
            i1++; i2++;
10
        } else if (nums1[i1] > nums2[i2]) i2++;
11
        else i1++;
12
    }
13
    return ret;
14
}