simple python code


  • 0
    M
    class Solution(object):
        def intersection(self, nums1, nums2):
            """
            :type nums1: List[int]
            :type nums2: List[int]
            :rtype: List[int]
            """
            list = []
            if len(nums1) == 0 or len(nums2) == 0:
                return list
            s = set(nums1) & set(nums2)
            for i in s:
                list.append(i)
            return list
    

  • 2
    D

    or simply:

    return list( set(nums1) & set(nums2) )


Log in to reply
 

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