题目原文:
Given two arrays, write a function to compute their intersection.
Example:
Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2, 2].
Note:
Each element in the result should appear as many times as it shows in both arrays.
The result can be in any order.
题目大意:
跟上题一样,区别是多次重复的要返回多个。
题目分析:
上回用的是set,这次用的是collection。
源码:(language:python)
class Solution(object):
def intersect(self, nums1, nums2):
return list((collections.Counter(nums1) & collections.Counter(nums2)).elements())
成绩:
56ms
cmershen的碎碎念:
(1) python对数组、列表、集合等基本数据结构的处理真的是既简洁又强大。
(2) leetcode上的新题越来越水。