2026-01-22 15:45:34 +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.
"""
target, idx1, idx2 = m + n - 1, m - 1, n - 1
neg_inf = float("-inf")
while target >= 0:
if idx1 >= 0:
num1 = nums1[idx1]
else:
num1 = neg_inf
if idx2 >= 0:
num2 = nums2[idx2]
else:
num2 = neg_inf
if num1 >= num2:
nums1[target] = num1
idx1 -= 1
target -= 1
else:
nums1[target] = num2
idx2 -= 1
target -= 1