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 andnums2 are m and n respectively.

Subscribe to see which companies asked this question

Tags

Array, Two Pointers

----------------------------------------------------------------------------------------------------------------------------------------------------------------------------

Merge from the last

/**
 * @param {number[]} nums1
 * @param {number} m
 * @param {number[]} nums2
 * @param {number} n
 * @return {void} Do not return anything, modify nums1 in-place instead.
 */
var merge = function (nums1, m, nums2, n) {
    // sort from the back
    // last index is m+n-1

    while (m > 0 && n > 0) {
        if (nums2[n - 1] >= nums1[m - 1]) {
            nums1[m + n - 1] = nums2[n - 1];
            n--;
        } else {
            nums1[m + n - 1] = nums1[m - 1];
            m--;
        }
    }

    while (n > 0) {
        nums1[m + n - 1] = nums2[n - 1];
        n--;
    }
};