350. Intersection of Two Arrays II (求两个数组的交集,包含重复元素)
2016-10-28 11:29
441 查看
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 nums2'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?
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 nums2'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?
import java.util.Hashtable; public class Solution { public int[] intersect(int[] nums1, int[] nums2) { int[] temp = new int[nums1.length]; int index = 0; Map<Integer,Integer> table = new Hashtable<Integer, Integer>(); for(int i:nums1){ if(table.get(i)==null) table.put(i, 1); else table.put(i, table.get(i)+1); } for(int i:nums2){ if(table.get(i)!=null&&table.get(i)!=0){ temp[index++] = i; table.put(i, table.get(i)-1); } } int[] res = new int[index]; while(index>0){ res[index-1] = temp[index-1]; index--; } return res; } }
相关文章推荐
- [LeetCode] Intersection of Two Arrays II 两个数组的交集II
- 350. Intersection of Two Arrays II | 查找两个数组重复
- Intersection of Two Arrays II两个数组交集(重要!)
- Leetcode 350. Intersection of Two Arrays II 两个数组的交集 II
- leetcode 350. Intersection of Two Arrays II 两个数组的交集
- [LeetCode]350. Intersection of Two Arrays II(求两个数组交集 II)
- 349. Intersection of Two Arrays (求两个数组的交集,不包含重复元素)
- Leetcode:350. Intersection of Two Arrays II 求两个数组的交集
- [easy]【leetcode】【java】 Intersection of Two Arrays II 两个数组的交集
- leetcode-350 Intersection of Two Arrays II 求两个数组的交集 面试见到了吗?
- LeetCode--350. Intersection of Two Arrays II(两个数组的交集)Python
- 程序员面试题目总结--数组(二)【二分查找、找出给定数字出现次数、两个有序整型数组交集、找出数组中唯一的重复元素、判断数组中的数值是否连续相邻】
- Leetcode :Intersection of Two Arrays 两个数组的交集
- [LeetCode] 350. Intersection of Two Arrays II 两个数组相交II
- [LeetCode] Intersection of Two Arrays II 两个数组相交之二
- LeetCode 350. Intersection of Two Arrays II(数组交集)
- [LeetCode] Intersection of Two Arrays 两个数组的交集
- 【转载】两个排序数组的中位数 / 第K大元素(Median of Two Sorted Arrays)
- 计算两个数组的交集,并去掉重复的元素,把最后结果存入其中的一个数组中。
- Intersection of Two Arrays II(两数组的交叉元素II)