# leetcode 350. 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?


public class Solution {
public int[] intersect(int[] nums1, int[] nums2) {
Map<Integer,Integer> map1 =new HashMap<Integer,Integer>();
Map<Integer,Integer> map2 =new HashMap<Integer,Integer>();

List<Integer> ans1= new ArrayList<Integer>();

for(int n : nums1) map1.put(n,map1.getOrDefault(n,0)+1);
for(int n : nums2) map2.put(n,map2.getOrDefault(n,0)+1);

for(int n : map2.keySet()){
if(map1.containsKey(n)){
int cc=0;
if(map1.get(n)>map2.get(n)) cc=map2.get(n);
else cc=map1.get(n);
for(int i=0;i<cc;i++)
}
}

int[] re= new int[ans1.size()];
for(int i=0;i<re.length;i++) re[i]=ans1.get(i);
return re;
}
}
• 本文已收录于以下专栏：

## leetcode350~Intersection of Two Arrays II

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

## <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] 350. Intersection of Two Arrays II

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

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

[LeetCode] 350. Intersection of Two Arrays II 解题思路
• zhao_tw
• 2016年10月20日 19:52
• 101

## 350. Intersection of Two Arrays II

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

## 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 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)