【哈希表】leetcode_349_两个数组的交集

【哈希表】leetcode_349_两个数组的交集

c++

class Solution {
public:
    vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {
        unordered_set<int> s1(nums1.begin(), nums1.end());
        vector<int> re_v;
        for (int i : nums2){
            if(s1.find(i) != s1.end()){
                    re_v.push_back(i);
            }
        }
        unordered_set<int> re_s(re_v.begin(), re_v.end());
        return vector<int> (re_s.begin(), re_s.end());
    }
};

class Solution {
public:
    vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {
        unordered_set<int> s1(nums1.begin(), nums1.end());
        unordered_set<int> re_s;
        for (int i : nums2){
            if(s1.find(i) != s1.end()){
                    re_s.insert(i);
            }
        }
        return vector<int> (re_s.begin(), re_s.end());
    }
};

python

class Solution:
    def intersection(self, nums1: List[int], nums2: List[int]) -> List[int]:
        l3=[]
        for i in nums1:
            if i in nums2:
                l3.append(i)
        return list(set(l3))