LeetCode 0349 - Intersection of Two Arrays

Reck Zhang

发布于 2021-08-11 11:32:58

2030

发布于 2021-08-11 11:32:58

文章被收录于专栏：Reck ZhangReck Zhang

Intersection of Two Arrays

Desicription

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

Example 1:

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

Example 2:

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

Note:

Each element in the result must be unique.
The result can be in any order.

Solution

class Solution {
public:
    std::vector<int> intersection(std::vector<int>& nums1, std::vector<int>& nums2) {
        auto set1 = std::set<int>();
        auto set2 = std::set<int>();
        for(auto num : nums1) {
            set1.insert(num);
        }

        auto res = std::vector<int>();
        for(auto num : nums2) {
            if(set1.find(num) != set1.end()) {
                set2.insert(num);
            }
        }

        for(auto num : set2) {
            res.push_back(num);
        }
        return res;
    }
};

本文参与腾讯云自媒体同步曝光计划，分享自作者个人站点/博客。

原始发表：2019-06-07，如有侵权请联系 cloudcommunity@tencent.com 删除

arrays