Intersection of Two Arrays II Python Solution

lcpy gen -n 350   # by problem number
lcpy gen -s intersection_of_two_arrays_ii   # by problem name

Input: nums1 = [1,2,2,1], nums2 = [2,2]
Output: [2,2]

Input: nums1 = [4,9,5], nums2 = [9,4,9,8,4]
Output: [4,9]
Explanation: [9,4] is also accepted.

from collections import Counter


class Solution:
    # Time: O(m + n)
    # Space: O(min(m, n))
    def intersection(self, nums1: list[int], nums2: list[int]) -> list[int]:
        if len(nums1) > len(nums2):
            nums1, nums2 = nums2, nums1
        counts = Counter(nums1)
        result: list[int] = []
        for num in nums2:
            if counts[num] > 0:
                counts[num] -= 1
                result.append(num)
        return result