88. Merge Sorted Array

Description

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.

Solution

Iteration from back to front

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