Python one liner Complexity: O(len(nums1) * len(nums2))

  • 0

    class Solution(object):
    def intersection(self, nums1, nums2):
    :type nums1: List[int]
    :type nums2: List[int]
    :rtype: List[int]
    #Converting lists to set and taking intersection of both the set
    return list(set(nums1) & set(nums(2)))

Log in to reply

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.