# 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题解-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
• Ekinnn
• 2017年01月03日 17:47
• 104

## LeetCode 350.Intersection_of_TwoArrays2

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

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

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

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

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

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

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

举报原因： 您举报文章：leetcode350 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)