88. Merge Sorted Array
2016-08-19 08:57
155 查看
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,j=n-1,z=m+n-1;
while(i>=0&&j>=0)
{
if(nums1[i]>nums2[j])nums1[z--]=nums1[i--];
else nums1[z--]=nums2[j--];
}
while(j>=0)
{
nums1[z--]=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,j=n-1,z=m+n-1;
while(i>=0&&j>=0)
{
if(nums1[i]>nums2[j])nums1[z--]=nums1[i--];
else nums1[z--]=nums2[j--];
}
while(j>=0)
{
nums1[z--]=nums2[j--];
}
}
}
相关文章推荐
- 88. Merge Sorted Array
- leetcode-88. Merge Sorted Array
- 【一天一道LeetCode】#88. Merge Sorted Array
- LeetCode 88. Merge Sorted Array
- leetcode-java-88. Merge Sorted Array
- 88. Merge Sorted Array
- 【leetcode】88. Merge Sorted Array【java】
- leecode 解题总结:88. Merge Sorted Array
- leetcode-88. Merge Sorted Array
- [LeetCode]88. Merge Sorted Array
- [leetcode]88. Merge Sorted Array(Java)
- 【leetcode】88. Merge Sorted Array (easy)
- leetcode 88. Merge Sorted Array
- 88. Merge Sorted Array
- 88. Merge Sorted Array
- [Leetcode] 88. Merge Sorted Array
- 88. Merge Sorted Array
- leetcode 88. Merge Sorted Array
- 【一天一道LeetCode】#88. Merge Sorted Array
- 88. Merge Sorted Array(python)