查找.md

查找

LeetCode 349 Intersection Of Two Arrays 1

class Solution:
    def intersection(self, nums1: List[int], nums2: List[int]) -> List[int]:
        num1 = set(nums1)
        return set([x for x in nums2 if x in num1])

LeetCode 350 Intersection Of Two Arrays 2

class Solution:
    def intersect(self, nums1: List[int], nums2: List[int]) -> List[int]:
        from collections import Counter
        nums1_dict = Counter(nums1)
        res = []
        for num in nums2:
            if nums1_dict[num] > 0:
                res.append(num)
                nums1_dict[num] -= 1
        return res