LeetCode-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.

这种merge两个List的题目。除了可以从头往后merge，也可以从后往前merge

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