s0088_merge_sorted_array.go

/*
	https://leetcode.com/problems/merge-sorted-array/

	You are given two integer arrays nums1 and nums2, sorted in non-decreasing
		order,
	and two integers m and n, representing the number of elements in nums1 and
		nums2 respectively.

 	Merge nums1 and nums2 into a single array sorted in non-decreasing order.

	The final sorted array should not be returned by the function, but instead be
		stored
	inside the array nums1. To accommodate this, nums1 has a length of m + n, where
		the first m
	elements denote the elements that should be merged, and the last n elements are
		set to 0 and
	should be ignored. nums2 has a length of n.
*/

package solutions

func merge(nums1 []int, m int, nums2 []int, n int) {
	if n == 0 {
		return
	}

	if m == 0 {
		copy(nums1, nums2)
	}

	i, j, k := m-1, n-1, m+n-1
	//nolint:gosec // it's ok
	for i >= 0 && j >= 0 && k >= 0 {
		if nums1[i] > nums2[j] {
			nums1[k] = nums1[i]
			i--
		} else {
			nums1[k] = nums2[j]
			j--
		}
		k--
	}

	//nolint:gosec // it's ok
	for j >= 0 {
		nums1[k] = nums2[j]
		k--
		j--
	}
}