# 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

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

## leetcode349~Intersection of Two Arrays

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

## 349. Intersection of Two Arrays

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

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

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

## [LeetCode-349] Intersection of Two Arrays(java)

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

## LeetCode349 Intersection of Two Arrays

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