350. Intersection of Two Arrays II
来源:互联网 发布:阿里云部署git服务器 编辑:程序博客网 时间:2024/05/16 01:55
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 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?
public class Solution { public int[] intersect(int[] nums1, int[] nums2) { ArrayList<Integer> result = new ArrayList<Integer>(); int i = 0, j = 0; Arrays.sort(nums1); Arrays.sort(nums2); while (i < nums1.length && j < nums2.length) { if (nums1[i] < nums2[j]) { i ++; } else if (nums1[i] > nums2[j]) { j ++; } else { result.add(nums1[i]); i ++; j ++; } } int[] r = new int[result.size()]; for (int k = 0; k < result.size(); k++) { r[k] = result.get(k); } return r; }}
0 0
- 350. Intersection of Two Arrays II
- LeetCode 350. Intersection of Two Arrays II
- leetcode.350. Intersection of Two Arrays II
- 350. Intersection of Two Arrays II【E】
- 350. Intersection of Two Arrays II
- [leetcode] 350. Intersection of Two Arrays II
- Leetcode 350. Intersection of Two Arrays II
- leetcode 350. Intersection of Two Arrays II
- 350. Intersection of Two Arrays II
- 350. Intersection of Two Arrays II
- Leetcode 350. Intersection of Two Arrays II
- [leetcode] 350. Intersection of Two Arrays II
- leetcode 350. Intersection of Two Arrays II
- 350. Intersection of Two Arrays II
- 350. Intersection of Two Arrays II
- 【leetcode】350. Intersection of Two Arrays II
- 350. Intersection of Two Arrays II
- 350. Intersection of Two Arrays II
- 将netbeans界面语言设置为英文
- 循序渐进讲解 Python 装饰器
- C++11之动态类型引入(影响面广)
- LeetCode266. Palindrome Permutation
- Leetcode-454. 4Sum II
- 350. Intersection of Two Arrays II
- password_hash的使用方法
- 关于面试的一些总结
- bzoj 1069: [SCOI2007]最大土地面积 (旋转卡壳)
- System.Media 命名空间小结
- LeetCode 293. Flip Game
- node js 进程守护神forever
- 7.傅立叶变换
- Leetcode-453. Minimum Moves to Equal Array Elements