Leetcode Everyday: 350. Intersection of Two Arrays II
2016-05-21 20:01
459 查看
https://leetcode.com/problems/intersection-of-two-arrays-ii/
Given two arrays, write a function to compute their intersection.
Example:
Given nums1 =
Note:
Each element in the result should appear as many times as it shows in both arrays.
The result can be in any order.
Follow up:
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?
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.
Follow up:
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) { HashMap<Integer, Integer> hm = new HashMap<Integer,Integer>(); for(int i: nums1){ hm.put(i,hm.getOrDefault(i,0)+1); } ArrayList<Integer> arrl = new ArrayList<Integer>(); for(int i: nums2){ if(hm.containsKey(i)){ arrl.add(i); int n = 9cc6 hm.get(i)-1; if(n==0) hm.remove(i); else hm.put(i,n); } } int ret[] = new int[arrl.size()]; for(int i=0;i<arrl.size();i++){ ret[i] = arrl.get(i); } return ret; } }
相关文章推荐
- 函数的调用约定
- 连续性1
- Java正则表达式
- DeepID人脸识别算法之三代
- Java正则表达式
- LeetCode|Binary Tree Right Side View
- 4G网络架构
- leetcode笔记--Create Maximum Number
- Eclipse导入git上的maven web项目详解
- Miller_Rabin codevs 1702 素数判定2
- 34. Search for a Range
- 错误调试
- 微软扫盲贴:Windows 和 GPT 常见问题解答(uefi、GPT、ESP、MSR之类的概念)
- HDU 5692 线段树
- Linux音频设备驱动
- 今天开始来写技术感受了望和同行技术人员一起交流恳请技术人员们谅解下让我首先发布下: 国学十二道 及 一句话概括国学经典书目精髓
- Google深度学习笔记 从线性分类器到深度神经网络
- 地图篇-01.获取用户位置
- poj 2492 A Bug's Life
- acm_stl