LeetCode解题笔记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].

Note:

• Each element in the result must be unique.
• The result can be in any order.

python解法一：

from collections import Counter
class Solution:
    def intersection(self, nums1, nums2):
        """
        :type nums1: List[int]
        :type nums2: List[int]
        :rtype: List[int]
        """
        res = []
        d1 = Counter(nums1)
        d2 = Counter(nums2)
        for k,v in d2.items() if len(d2)<len(d1) else d1.items() :
            d = d2 if len(d2)>=len(d1) else d1
            if k in d:
                res.append(k)
        return res