查找表_leetcode349

# 解题思路：无 20190302 找工作期间

class Solution(object):
    def intersection(self, nums1, nums2):
        """
        :type nums1: List[int]
        :type nums2: List[int]
        :rtype: List[int]
        """

        set1 = set(nums1)
        res = []
        for i in set1:
            if i in nums2:
                res.append(i)
        return res

查找表_leetcode349

原文：https://www.cnblogs.com/lux-ace/p/10546950.html