349.-liang-ge-shu-zu-de-jiao-ji.md

349. 两个数组的交集

https://leetcode-cn.com/problems/intersection-of-two-arrays/

解法一：求交集

class Solution:
    def intersection(self, nums1: List[int], nums2: List[int]) -> List[int]:
        res = []
        s1 = set(nums1)
        s2 = set(nums2)
        for i in s1 & s2:  #直接求交集
            res.append(i)
        return res