Leetcode Intersection of Two Arrays II Python 如何求两个数组的交集 Counter()统计出现次数和.element()返回指定次数个元素 的用法

Leetcode 350题 Intersection of Two Arrays II
Given two arrays, write a function to compute their intersection.

Example 1:

Input: nums1 = [1,2,2,1], nums2 = [2,2]
Output: [2,2]

Example 2:

Input: nums1 = [4,9,5], nums2 = [9,4,9,8,4]
Output: [4,9]

Note:

Each element in the result should appear as many times as it shows in both arrays.
The result can be in any order.

Follow up:

What if the given array is already sorted? How would you optimize your algorithm?
What if nums1's size is small compared to nums2's size? Which algorithm is better?
What if elements of nums2 are stored on disk, and the memory is limited such that you cannot load all elements into the memory at once?

---

Python的脚本语言优势体现出来了。
一行代码解决问题。

class Solution:
    def intersect(self, nums1: List[int], nums2: List[int]) -> List[int]:
        return list((Counter(nums1) & Counter(nums2)).elements())

Counter()的用法。
Counter()用于技术可哈希的对象。 就是用来统计某元素出现的次数。

>>> from collections import Counter
>>> c = Counter('abcasd')
>>> c
Counter({'a': 2, 'c': 1, 'b': 1, 's': 1, 'd': 1})

.element()方法的用法。
返回一个迭代器，其中每个元素将重复出现计数值所指定次。 元素会按首次出现的顺序返回。 如果一个元素的计数值小于一，elements() 将会忽略它。

>>>c = Counter(a=4, b=2, c=0, d=-2)
>>>sorted(c.elements())
['a', 'a', 'a', 'a', 'b', 'b']

这个代码的意思就是，统计两个数字各个元素的出现次数，当出现次数相同时，返回它。

疫情中的英国，
压力真大。
25/05/2020