350. Intersection of Two Arrays II

最新推荐文章于 2024-10-20 21:47:19 发布

qq_34229391

最新推荐文章于 2024-10-20 21:47:19 发布

阅读量94

点赞数

分类专栏： LeetCode 文章标签： leetcode Array Intersection

本文链接：https://blog.csdn.net/qq_34229391/article/details/82723969

版权

LeetCode 专栏收录该内容

23 篇文章 0 订阅

订阅专栏

Given two arrays, write a function to compute their intersection.

Example 1:

Input: nums1 = [1,2,2,1], nums2 = [2,2]
Output: [2,2]

Example 2:

Input: nums1 = [4,9,5], nums2 = [9,4,9,8,4]
Output: [4,9]

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?

对于Follow up中的要求，在以下的代码中没有得到体现。。。。。。

vector<int> intersect(vector<int>& nums1, vector<int>& nums2)
{
    if(nums1.size() > nums2.size())
    {
        vector<int> temp = nums1;
        nums1 = nums2;
        nums2 = temp;
    }
    multiset<int> n1;
    multiset<int> contemporary;
    for(auto a : nums1)n1.insert(a);
    for(auto b : nums2)
    {
        if(n1.find(b) != n1.end())
        {
            contemporary.insert(b);
            n1.erase(n1.find(b));
        }
    }
    vector<int> result;
    for(set<int>::iterator it = contemporary.begin(); it != contemporary.end(); it++)result.push_back(*it);
    return result;
}