# leetcode 350. Intersection of Two Arrays II

218人阅读 评论(0)

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;
}
}
0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：21404次
• 积分：906
• 等级：
• 排名：千里之外
• 原创：70篇
• 转载：17篇
• 译文：0篇
• 评论：1条
文章分类
最新评论