350. Intersection of Two Arrays II
来源:互联网 发布:机房网络交换机回收 编辑:程序博客网 时间:2024/06/06 02:12
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?
解法一:
Language-Java Run Time-3ms
public class Solution { public int[] intersect(int[] nums1, int[] nums2) { Arrays.sort(nums1); Arrays.sort(nums2); int i = 0; int j = 0; int count = 0; int result[] =new int[Math.min(nums1.length, nums2.length)]; while(i < nums1.length && j < nums2.length) { if(nums1[i] == nums2[j]){ result[count++] = nums1[i]; i ++; j ++; }else if(nums1[i] < nums2[j]){ i ++; }else{ j ++; } } //复制指定的数组,截取或用 0 填充(如有必要),以使副本具有指定的长度 return Arrays.copyOf(result, count); }}
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
- java的Observable类中,notifyObservers(Object arg)和notifyObservers()的区别
- 为什么极大似然估计得到的方差是有偏估计
- http://blog.csdn.net/woshizhangliang999/article/details/51649461
- 王朝 钱得分配
- 输出1-100中能被3整除但不能被5整除的数,并统计这样的数有多少个
- 350. Intersection of Two Arrays II
- Php中使用PDO操作MySQL数据库(查询 更新 删除)
- 用户从键盘输入月份,使用switch语句输出该月份的天数
- ros中遇到的一些小问题
- 手机助手(一):准备阶段
- 首次登陆Centos与在线求助man page
- Autostart script in ubuntu
- 打印九九乘法表
- 代码整洁之道--有意义的命名