Skip to content

349. Intersection of Two Arrays

Difficulty Topics

Description

Given two integer arrays nums1 and nums2, return an array of their intersection. Each element in the result must be unique and you may return the result in any order.

 

Example 1:

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

Example 2:

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

 

Constraints:

  • 1 <= nums1.length, nums2.length <= 1000
  • 0 <= nums1[i], nums2[i] <= 1000

Solution

intersection-of-two-arrays.py
class Solution:
    def intersection(self, nums1: List[int], nums2: List[int]) -> List[int]:

        temp1 = collections.Counter(nums1)

        temp2 = collections.Counter(nums2)

        temp = []

        for i in temp1:

            if i in temp2:
                if max(temp1[i],temp2[i],0)>0:
                    temp.append(i)

        return temp