Sunbelt Computer Software

PL/B Language Development and Support

leetcode-javascript/merge-sorted-array.js at master · didi0613/leetcode-javascript · GitHub

/**

* @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--;

}

};