LeetCode | 349. Intersection of Two Arrays

最新推荐文章于 2025-05-09 14:48:06 发布

1LOVESJohnny

最新推荐文章于 2025-05-09 14:48:06 发布

阅读量160

点赞数

分类专栏： LeetCode 文章标签： leetcode 数组

本文链接：https://blog.csdn.net/iLOVEJohnny/article/details/120028090

版权

LeetCode 专栏收录该内容

285 篇文章

订阅专栏

.

题目

Given two integer arrays nums1 and nums2, return an array of their intersection. Each element in the result must be unique and you may return the result in any order.

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]

Explanation: [4,9] is also accepted.

Constraints:

1 <= nums1.length, nums2.length <= 1000
0 <= nums1[i], nums2[i] <= 1000

.

代码

class Solution {
public:
    vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {
        set<int> s1, s2;
        vector<int> res;
        for(int i = 0; i<nums1.size(); i++)
            s1.insert(nums1[i]);
        for(int i = 0; i<nums2.size(); i++)
            s2.insert(nums2[i]);
        for(set<int>::iterator iter = s2.begin(); iter != s2.end(); iter++)
            if(s1.find(*iter) != s1.end())
                res.push_back(*iter);
        return res;
    }
};