# Easy-题目72：349. Intersection of Two Arrays（增补5）

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.

class Solution(object):
def intersection(self, nums1, nums2):
return list(set(nums1) & set(nums2))

60ms

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

2016-05-27 12:56:58

#### 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

#### leetcode 记录 349. Intersection of Two Arrays

2016-05-18 21:09:57

#### 349. Intersection of Two Arrays

2016-05-18 15:17:13

#### [leetcode] 349. Intersection of Two Arrays

2016-05-19 16:01:01

#### leetcode_350 Intersection of Two Arrays II

2016-05-28 18:17:30

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

2016-05-25 10:15:52

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

2016-06-26 23:21:28