美文网首页
350. Intersection of Two Arrays

350. Intersection of Two Arrays

作者: a_void | 来源:发表于2016-09-16 16:17 被阅读0次

    iven 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?
    class Solution {
    public:
        vector<int> intersect(vector<int>& nums1, vector<int>& nums2) {
            map<int, int> m = map<int, int>();
            vector<int> r = vector<int>();
            for(int i=0;i<nums1.size();i++)
                m[nums1[i]] += 1;
            for(int i=0;i<nums2.size();i++){
                if(m[nums2[i]] > 0){
                    r.push_back(nums2[i]);
                    m[nums2[i]]-=1;
                }
            }
            return r;
        }
    };
    

    相关文章

      网友评论

          本文标题:350. Intersection of Two Arrays

          本文链接:https://www.haomeiwen.com/subject/kiliettx.html