Function merge0

merge_sorted_array_88/solution.go:56–77

Note: original solution with array shifting

(nums1 []int, m int, nums2 []int, n int)

// Note: original solution with array shifting
func merge0(nums1 []int, m int, nums2 []int, n int) {
	slot := 0

	// for each in nums2, insert into nums1
	for i := 0; i < n; i++ {

		// find the slot to insert nums2[i] into
		for slot < m+i && nums1[slot] <= nums2[i] {
			slot++
		}

		// count how many shifts are needed
		shiftCnt := m - slot + 1 + i

		// shift over each number to insert nums2[i]
		for s := 0; s < shiftCnt; s++ {
			hold := nums2[i]
			nums2[i] = nums1[slot+s]
			nums1[slot+s] = hold
		}
	}
}