LeetCod: 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]

代码：
归并算法，不过要注意我们要从后往前，不然会涉及到移动问题。

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