先看题
解法
const merge = function (nums1, m, nums2, n) {
let loopLength = m + n;
let j = 0
let k = 0
while (loopLength) {
let count = n - k;
if (nums1[j] > nums2[k]) {
nums1.splice(j, 0, nums2[k])
nums1.pop()
k++
} else if (loopLength === count) {
nums1.splice(j, 0, nums2[k])
nums1.pop()
k++
}
j++
loopLength--
}
};