[LeetCode Sync] Runtime - 3 ms (40.45%), Memory - 18 MB (26.59%)

Author: NinePiece2

Solutions/0350-intersection-of-two-arrays-ii/solution.py

@@ -0,0 +1,11 @@
+class Solution:
+    def intersect(self, nums1: List[int], nums2: List[int]) -> List[int]:
+        count = Counter(nums1)
+        result = []
+
+        for val in nums2:
+            if count[val]:
+                result.append(val)
+                count[val] -= 1
+        
+        return result