[리트코드 leetcode] 349. Intersection of Two Arrays

leetcode.com/problems/intersection-of-two-arrays/

Intersection of Two Arrays - LeetCode

class Solution:
    def intersection(self, nums1: List[int], nums2: List[int]) -> List[int]:
        a=list(set(nums1))
        b=list(set(nums2))
        
        dct = collections.Counter(a+b)
        
        ans =[]
        
        for key in dct:
            if dct[key]>1:
                ans.append(key)
                
        return ans