Files
PS/leetcode/350.py
Gyubin Han dede0dca01 leetcode
2025-02-19 14:09:55 +09:00

16 lines
399 B
Python

class Solution:
def intersect(self, nums1: List[int], nums2: List[int]) -> List[int]:
result=[]
check={}
for i in nums1:
if i in check:
check[i]+=1
else:
check[i]=1
for i in nums2:
if i in check and check[i]>0:
check[i]-=1
result.append(i)
return result