插入排序思想:
let nums1 = [1, 2, 3, 0, 0, 0], m = 3, nums2 = [2, 2, 4], n = 3
let nl1 = m;
for (let i = 0; i < n; i++) {
let pre = nums2[i]
let n = nl1
while (n > 0 && nums1[n - 1] > pre) {
nums1[n] = nums1[n - 1]
n--
}
nums1[n] = pre
nl1++
}
console.log(nums1);
插入排序
for (let i = 1; i < nums1.length; i++) {
let pre = nums1[i]
let ti = i
while (ti > 0 && nums1[ti - 1] > pre) {
nums1[ti] = nums1[ti - 1]
ti--
}
nums1[ti] = pre
}