【Leetcode】Merge Sorted Array
来源:互联网 发布:cif与fob的算法 编辑:程序博客网 时间:2024/05/09 23:08
题目链接:https://leetcode.com/problems/merge-sorted-array/
题目:
Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.
Note:
You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional elements from nums2. The number of elements initialized in nums1and nums2 are m and n respectively.
思路:
直接做就好了easy
算法:
public void merge(int[] nums1, int m, int[] nums2, int n) {int i = 0, j = 0, k = 0;int nums3[] = new int[m + n];while (i < m && j < n) {if (nums1[i] > nums2[j]) {nums3[k] = nums2[j];j++;} else {nums3[k] = nums1[i];i++;}k++;}if (i == m) {for (int ii = j; ii < n; ii++, k++)nums3[k] = nums2[ii];}if (j == n) {for (int ii = i; ii < m; ii++, k++)nums3[k] = nums1[ii];}for (int ii = 0; ii < m + n; ii++) {//将数组3拷贝到数组1nums1[ii] = nums3[ii];}}
0 0
- LeetCode: Merge Sorted Array
- [Leetcode] Merge Sorted Array
- [LeetCode] Merge Sorted Array
- [LeetCode]Merge Sorted Array
- [leetcode]Merge Sorted Array
- [Leetcode]Merge Sorted Array
- LeetCode-Merge Sorted Array
- [leetcode] Merge Sorted Array
- LeetCode - Merge Sorted Array
- [LeetCode] Merge Sorted Array
- LeetCode | Merge Sorted Array
- 【leetcode】Merge Sorted Array
- Leetcode: Merge Sorted Array
- Leetcode: Merge Sorted Array
- LeetCode - Merge Sorted Array
- [LeetCode]Merge Sorted Array
- Merge Sorted Array -- LeetCode
- Merge Sorted Array - LeetCode
- mysql中select5种子句之limit
- 一个我纠结很久的background和background-image关系区别问题
- EasyUI中文帮助文档
- 【Leetcode】Remove Duplicates from Sorted Array II
- 使用IE浏览器打开Axture页面原型时出现限制网页运行的问题
- 【Leetcode】Merge Sorted Array
- 62,OC多文件开发
- JDeveloper Memory And Performance
- Android之判断当前网络状态
- Swift在实际项目中的应用
- 设计模式之装饰者模式(二)---java中的装饰者I/O结构
- 【Leetcode】Search for a Range
- java中的串池
- Visual Studio 2013不能单步调试、不能断点调试的解决方法之一