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.

给定两个有序的数组，将它们合并成为一个有序的数组。我们可以从两个数组的右边开始比较，把大的元素放在数组的m + n - 1处，如果nums1当前元素大于nums2当前元素，就把nums1的指针后移 m--; 否则 把指向nums2的指针前移 n--；最后不要忘记检查nums2中是否还有剩余元素。代码如下：

public class Solution {
    public void merge(int[] nums1, int m, int[] nums2, int n) {
        while(m > 0 && n > 0) {
            if(nums1[m - 1] > nums2[n - 1]) {
                nums1[m + n - 1] = nums1[m - 1];
                m --;
            } else {
                nums1[m + n - 1] = nums2[n - 1];
                n --;
            }
        }
        while(n > 0) {
            nums1[m + n - 1] = nums2[n - 1];
            n --;
        }
    }
}