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.
从后往前遍历数组
public class Solution {
public void merge(int[] nums1, int m, int[] nums2, int n)
{
int k1=m-1,k2=n-1;
for(int i=m+n-1;i>=0;i--)
{
if(k1<0 )
{
nums1[i]=nums2[k2--];
continue;
}
if(k2<0)
{
nums1[i]=nums1[k1--];
continue;
}
if(nums1[k1]>nums2[k2])
nums1[i]=nums1[k1--];
else
nums1[i]=nums2[k2--];
}
}
}