leetcode-88. 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.

需要注意k并不等于m+n

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