349. Intersection of Two Arrays

Given two arrays, write a function to compute their intersection.

Example:
Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2].

返回两个列表相同的元素 去重的

code:

class Solution(object):
    def intersection(self, nums1, nums2):
        """
        :type nums1: List[int]
        :type nums2: List[int]
        :rtype: List[int]
        """
        res=[]
        if len(nums1)>=len(nums2):
            nums3=sorted(nums1)
            for y in nums2:
                if y in nums3:
                    res.append(y)
            
        else:
            nums4=sorted(nums2)
            for y in nums1:
                if y in nums4:
                    nums4.remove(y)
                    res.append(y)
        return list(set(res))