leetcode-350-两个数组的交集Ⅱ

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

class Solution:
    def intersect(self, nums1: List[int], nums2: List[int]) -> List[int]:
        num1 = collections.Counter(nums1)
        num2 = collections.Counter(nums2)
        num = num1 & num2
        return num.elements()