88. Merge Sorted Array

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.

合并有序数组 ps：其实和上一题（Merge Two Sorted Lists）一样**

代码

public 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--]; //因为是把nums2的数组移到nums1中，所以当nums2比nums1小没有加完时；应当补上
    }
}