# 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

Given two arrays, write a function to compute their intersection.Example: Given nums1 = [1, 2, 2, 1...

## leetcode350~Intersection of Two Arrays II

Given two arrays, write a function to compute their intersection. Example: Given nums1 = [1, 2, 2...

## [leetcode] 350. Intersection of Two Arrays II

Given two arrays, write a function to compute their intersection. Example: Given nums1 = [1, 2, ...

## [LeetCode] 350. Intersection of Two Arrays II

[LeetCode] 350. Intersection of Two Arrays II 解题思路

## <LeetCode OJ> 349 / 350 Intersection of Two Arrays（I / II）

Total Accepted: 3212 Total Submissions: 6814 Difficulty: Easy Given two arrays, write a functio...

## 350. Intersection of Two Arrays II

Given two arrays, write a function to compute their intersection. Example: Given nums1 = [1, 2, 2, ...

## leetcode解题之349 & 350. Intersection of Two Arrays Java版（求数组交集））

350. Intersection of Two Arrays II leetcode解题之349. Intersection of Two Arrays & 350. Intersection ...

举报原因： 您举报文章：深度学习：神经网络中的前向传播和反向传播算法推导 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)