###### Easy-题目73：350. Intersection of Two Arrays II（增补6）

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.

class Solution(object):
def intersect(self, nums1, nums2):
return list((collections.Counter(nums1) & collections.Counter(nums2)).elements())

56ms
cmershen的碎碎念：
（1） python对数组、列表、集合等基本数据结构的处理真的是既简洁又强大。
（2） leetcode上的新题越来越水。

#### 350. Intersection of Two Arrays II [easy] (Python)

2016-05-25 10:15:52

#### leetcode_350 Intersection of Two Arrays II

2016-05-28 18:17:30

#### LeetCode 350. Intersection of Two Arrays II（数组交集）

2016-05-25 01:35:00

#### Leetcode 350. Intersection of Two Arrays II 数组交集2 解题报告

2016-05-24 11:11:35

#### Intersection of Two Arrays II两个数组交集（重要！）

2016-06-26 23:21:28

#### 349. Intersection of Two Arrays I &&II (Java)

2016-05-27 12:56:58

#### leetcode 350 Intersection of Two Arrays II C++

2016-05-23 15:22:30

#### [leetcode] 350. Intersection of Two Arrays II 解题报告

2016-05-23 13:21:22

#### LeetCode 349. Intersection of Two Arrays 题解（C++）

2016-10-11 15:44:20

#### Leetcode 349. Intersection of Two Arrays 解题报告 Python Java

2016-05-18 23:30:59

## 不良信息举报

Easy-题目73：350. Intersection of Two Arrays II（增补6）