Leetcode 349 Solution

This article provides solution to leetcode question 349 (intersection-of-two-arrays)
Categories:
Tags:
Access this page by simply typing in "lcs 349" in your browser address bar if you have bunnylol configured.

https://leetcode.com/problems/intersection-of-two-arrays

Solution

class Solution:
    def intersection(self, nums1: List[int], nums2: List[int]) -> List[int]:
        nums1.sort()
        nums2.sort()



        ans = set()
        i = 0
        j = 0
        while i < len(nums1) and j < len(nums2):
            if nums1[i] == nums2[j]:
                ans.add(nums1[i])
                i += 1
                j += 1
            elif nums1[i] > nums2[j]:
                j += 1
            else:
                i += 1
        return list(ans)