88. 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 nums1 and nums2 are m and n respectively.

Subscribe to see which companies asked this question

Show Tags

Show Similar Problems

解题思路：将数组从后往前拷贝，如果nums1 > nums2则拷贝nums1，反之拷贝nums1。

public class Solution {
public void merge(int[] nums1, int m, int[] nums2, int n) {
if(n == 0)
{
return ;
}

int i = m-1;
int j = n-1;
int k = m + n - 1;
while(k >= 0)
{
if (j < 0 || (i >= 0 && nums1[i] > nums2[j]))
nums1[k--] = nums1[i--];
else
nums1[k--] = nums2[j--];
}

}
}