88. Merge Sorted Array

Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.

Note:

The number of elements initialized in nums1 and nums2 are m and n respectively.
You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional elements from nums2.

Example:

Input:
nums1 = [1,2,3,0,0,0], m = 3
nums2 = [2,5,6],       n = 3

Output: [1,2,2,3,5,6]

solution:

class Solution {
    public void merge(int[] nums1, int m, int[] nums2, int n) {
        int i = m-1, j = n-1, k = m + n - 1;
        while(i>-1 && j > -1) nums1[k--] = (nums1[i] > nums2[j]) ? nums1[i--] : nums2[j--];
        while(j > -1) nums1[k--] = nums2[j--];
    }
}

第一个while很好理解，讲一下第二个while。当m > n 的时候num2会先被插好，这时候剩下的num1是初始化时就已经排好的，所以不用排；当m < n 的时候，也就是while(j > -1) 的时候, num1已经被重新安插好，这时候我们继续将num2的值插入num1中。