您的位置:首页 > 其它

Leetcode #349 Intersection of Two Arrays

2017-03-09 23:39 162 查看

Description

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.

Explain

python写真的太简洁

Code

class Solution(object):
def intersection(self, nums1, nums2):
"""
:type nums1: List[int]
:type nums2: List[int]
:rtype: List[int]
"""
import collections
return list(set(collections.Counter(nums1) & collections.Counter(nums2)))
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签:  leetcode