LeetCode 349. Intersection of Two Arrays [Python / C++]

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.

Python

#使用内置函数 & 求交集
class Solution(object):
    def intersection(self, nums1, nums2):
        return list(set(nums1) & set(nums2))

C++

方法① 使用set

class Solution {
public:
    vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {
        vector<int> res;
        set<int> myset(nums1.begin(), nums1.end());
        for(auto num : nums2){
            if(myset.count(num)){
                res.push_back(num);
                myset.erase(num);
            }
        }
        return res;
    }
};

方法② 使用内置函数set_intersection

class Solution {
public:
    vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {
        vector<int> res;
        set<int> a(nums1.begin(), nums1.end());
        set<int> b(nums2.begin(), nums2.end());
        set_intersection(a.begin(), a.end(), b.begin(), b.end(), back_inserter(res));
        return res;
    }
};