2026-01-22 15:41:51 +0000 UTC
Merge Sorted Array
Links
Code
class Solution:
def merge(self, nums1: List[int], m: int, nums2: List[int], n: int) -> None:
"""
Do not return anything, modify nums1 in-place instead.
"""
if not nums2:
return nums1
for i in reversed(range(m)):
nums1[i + n] = nums1[i]
target, idx1, idx2 = 0, 0, 0
inf = float("inf")
while target < m + n:
if idx1 < m:
num1 = nums1[idx1 + n]
else:
num1 = inf
if idx2 < n:
num2 = nums2[idx2]
else:
num2 = inf
if num1 < num2:
nums1[target] = num1
target += 1
idx1 += 1
else:
nums1[target] = num2
target += 1
idx2 += 1