Leetcode 349. Intersection of Two Arrays

Problem

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.

Algorithm

Collect all the elements in each list in two visited list and then return the items appear in both visited list.

Code

class Solution:
    def intersection(self, nums1: List[int], nums2: List[int]) -> List[int]:
        item1 = [0] * 1001
        item2 = [0] * 1001
        for i in nums1:
            item1[i] = 1
        for i in nums2:
            item2[i] = 1

        ans = []
        for i in range(1001):
            if item1[i] and item2[i]:
                ans.append(i)
        return ans