# leetcode350

350、easy Intersection of Two Arrays II
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.
What if the given array is already sorted? How would you optimize your algorithm?
What if nums1’s size is small compared to num2’s size? Which algorithm is better?
What if elements of nums2 are stored on disk, and the memory is limited such that you cannot load all elements into the memory at once?

我自己是这样做的，这样做并没有考虑follow up：
class Solution(object):
def intersect(self, nums1, nums2):
"""
:type nums1: List[int]
:type nums2: List[int]
:rtype: List[int]
"""
l=[]
for num in nums1:
if num in nums2:
l.append(num)
nums2.pop(nums2.index(num))
return l


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

## leetcode刷题，总结，记录，备忘 350

leetcode350Intersection of Two Arrays II Given two arrays, write a function to compute their in...

## 7 = 350 000 000 ?!

&lt;!-- [if gte mso 9]&gt;&lt;xml&gt; &lt;w:WordDocument&gt; &lt;w:View&gt;Normal&lt;/w:View&gt; &...

CSDN出品，立即查看！

## LeetCode-349&350.Intersection of Two Arrays

https://leetcode.com/problems/intersection-of-two-arrays/ Given two arrays, write a function to co...

## 文章收录1

3.Hive Metastore 代码简析 <td width="760" class=

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

Given two arrays, write a function to compute their intersection.

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