Two lines Python code


  • 3
    L
    class Solution(object):
        def intersection(self, nums1, nums2):
            """
            :type nums1: List[int]
            :type nums2: List[int]
            :rtype: List[int]
            """
            if not nums1 or not nums2: return []
            return list(set(nums1 + nums2) - (set(nums1) - set(nums2)) - (set(nums2) - set(nums1)))
    

  • 0

    Beautiful, very concise!


  • 0
    T
    This post is deleted!

  • 1
    T
    class Solution(object):
        def intersection(self, nums1, nums2):
            """
            :type nums1: List[int]
            :type nums2: List[int]
            :rtype: List[int]
            """
            return list(set(nums1).intersection(nums2))
    

Log in to reply
 

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