Intersection-of-Two-Arrays

发表于 | 更新于：

LeetCode#349 Intersection of Two Arrays

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

Example:
Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2].

Note:

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

解题思路

  没什么说的，直接遍历查找，找到就存值，直接看代码。

解题代码【.CPP】

1
2
3
4
5
6
7
8
9
10
11
12
class Solution {
public:
    std::vector<int> intersection(std::vector<int>& nums1, std::vector<int>& nums2) {
        std::set<int> rset;
        for (auto it = nums1.begin() ; it != nums1.end() ; ++it){
            if(std::find(nums2.begin() , nums2.end() , *it) != std::end(nums2)){
                rset.insert(*it);
            }
        }
        return std::vector<int>(rset.begin(),rset.end());
    }
};
0%