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.

1 public class Solution { 2     public void merge(int[] nums1, int m, int[] nums2, int n) { 3         if(n == 0) return; 4         int k = m + n - 1; 5         int i = m - 1; 6         int j = n - 1; 7         while(i >= 0 && j >= 0){ 8             if(nums1[i] > nums2[j]){ 9                 nums1[k--] = nums1[i--];10             }else{11                 nums1[k--] = nums2[j--];12             }13         }14         if(i < 0){//nums2 元素还有没处理完的15             while(j >= 0)nums1[k--] = nums2[j--];16         } 17     }18 }