Given two sorted integer arraysnums1andnums2, mergenums2intonums1as one sorted array.

Note:
You may assume thatnums1has enough space (size that is greater or equal tom+n) to hold additional elements fromnums2. The number of elements initialized innums1andnums2aremandnrespectively.

/*
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.

[4,5,6,0,0,0]
3
[1,2,3]
3
*/

class Solution {
    public void merge(int[] nums1, int m, int[] nums2, int n) {
        int index1 = m - 1, index2 = n - 1, index3 = m + n - 1;

        while (index1 >= 0 && index2 >= 0){
            if (nums1[index1] > nums2[index2]){
                nums1[index3--] = nums1[index1--];
            }
            else{
                nums1[index3--] = nums2[index2--];
            }
        }

        while (index2 >= 0){
            nums1[index3--] = nums2[index2--];
        }


    }

}