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.

 

public class Solution {
    public void Merge(int[] nums1, int m, int[] nums2, int n) {
        int target = m + n - 1, i = m - 1, j = n - 1;
        
        while (target >= 0)
        {
            if (i >= 0 && j >= 0)
            {
                nums1[target--] = nums1[i] >= nums2[j] ? nums1[i--] : nums2[j--];
            }
            else if (i >= 0)
            {
                nums1[target--] = nums1[i--];
            }
            else
            {
                nums1[target--] = nums2[j--];
            }
        }
    }
}