# leetcode349

349 easy Intersection of Two Arrays
*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):
"""
:type nums1: List[int]
:type nums2: List[int]
:rtype: List[int]
"""
l=[]
for num in nums1:
if num in nums2 and num not in l:
l.append(num)
return l
           然后在Discuss中看到有人居然只用了一句话！！！（好��）

return [x for x in set(nums1) if x in set(nums2)]

；还有就是使用列表生成简单了很多。

• 本文已收录于以下专栏：

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

## LeetCode 349.Intersection_of_TwoArrays

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

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

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

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

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

## 349.Intersection of Two AND 350. Intersection of Two Arrays II Arrays leetcode binary search

Two Sum II - Input array is sorted Given an array of integers that is already sorted in ascending o...

## leetcode349&350

1、Intersection of Two Arrays

## LeetCode349 Intersection of Two Arrays

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