Intersection of Two Arrays II.py

# https://leetcode.com/problems/intersection-of-two-arrays-ii/
# Hak Soo Kim
# 3/24/2022

class Solution(object):
    def intersect(self, nums1, nums2):
        ans = []
        nums1Dict = defaultdict(int)

        for num in nums1:
            nums1Dict[num] += 1

        for num in nums2:
            if (num in nums1Dict and nums1Dict[num] != 0):
                nums1Dict[num] -= 1
                ans.append(num)
        return ans
        """
        :type nums1: List[int]
        :type nums2: List[int]
        :rtype: List[int]
        """

# Given two integer arrays nums1 and nums2, return an array of their intersection. Each element in the result must appear as many times as it shows in both arrays and you may return the result in any order.
#
# Example 1:
#
# Input: nums1 = [1,2,2,1], nums2 = [2,2]
# Output: [2,2]
# Example 2:
#
# Input: nums1 = [4,9,5], nums2 = [9,4,9,8,4]
# Output: [4,9]
# Explanation: [9,4] is also accepted.
#
# Constraints:
#
# 1 <= nums1.length, nums2.length <= 1000
# 0 <= nums1[i], nums2[i] <= 1000