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.
合并两个有序数组到数组1
其实道理很简单，从后面开始合并就好了。只是一开始不太容易想到。
public class Solution {
public void merge(int[] nums1, int m, int[] nums2, int n) {
int l=m-1,r=n-1,v=m+n-1;
while(r >= 0){
if(l >=0 && nums1[l] > nums2[r] ){
nums1[v--] = nums1[l--];
}else{
nums1[v--] = nums2[r--];
}
}
}
}
