88. Merge Sorted Array (合并有序数组)
2016-10-27 22:04
363 查看
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 nums1 and nums2 are m and n respectively.
public class Solution {
public void merge(int[] nums1, int m, int[] nums2, int n) {
int i=m-1;
int j=n-1;
int k = m+n-1;
while(i >=0 && j>=0)
{
if(nums1[i] > nums2[j])
nums1[k--] = nums1[i--];
else
nums1[k--] = nums2[j--];
}
while(j>=0)
nums1[k--] = nums2[j--];
}
}
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 nums1 and nums2 are m and n respectively.
public class Solution {
public void merge(int[] nums1, int m, int[] nums2, int n) {
int i=m-1;
int j=n-1;
int k = m+n-1;
while(i >=0 && j>=0)
{
if(nums1[i] > nums2[j])
nums1[k--] = nums1[i--];
else
nums1[k--] = nums2[j--];
}
while(j>=0)
nums1[k--] = nums2[j--];
}
}
相关文章推荐
- Leetcode 88 Merge Sorted Array 合并两个有序数组
- leetcode88---Merge Sorted Array(合并有序数组)
- [LeetCode-88] Merge Sorted Array(合并有序数组)
- [leetcode]Merge Sorted Array (两个有序数组的合并 C语言实现)
- Merge Sorted Array 合并两个有序数组 @LeetCode
- 【leetcode】Merge Sorted Array(合并两个有序数组到其中一个数组中)
- leetcode Merge Sorted Array 合并有序数组
- [LeetCode]Merge Sorted Array(合并两个有序的数组)
- MergeSortedArray,合并两个有序的数组
- 高效合并两个有序数组(Merge Sorted Array)
- 【LeetCode】- Merge Sorted Array (合并有序数组).
- Merge Sorted Array -- 合并两个有序数组
- LeetCode 88 Merge Sorted Array(合并排序数组)(*)
- LeetCode Merge Sorted Array(合并有序数组)
- [LeetCode] Merge Sorted Array 合并两个有序数组
- leetcode:Merge Sorted Array(合并两个有序数组到其中一个数组中)【面试算法题】
- 高效合并两个有序数组(Merge Sorted Array)
- Merge Sorted Array合并两个有序数组
- Merge Sorted Array 合并两个有序数组
- merge-sorted-array——合并两个有序数组