Merge Sorted Array — LeetCode 88 Python Solution

The problem

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.

Example

Input

nums1 = [1,2,3,0,0,0], m = 3, nums2 = [2,5,6], n = 3

Output

[1,2,2,3,5,6]

Explanation

The arrays we are merging are [1,2,3] and [2,5,6].

Python solution

class Solution:
    def merge(self, nums1: List[int], m: int, nums2: List[int], n: int) -> None:
        k = m + n - 1
        i, j = m - 1, n - 1
        while j >= 0:
            if i >= 0 and nums1[i] > nums2[j]:
                nums1[k] = nums1[i]
                i -= 1
            else:
                nums1[k] = nums2[j]
                j -= 1
            k -= 1

Complexity

Pattern: Two Pointers

Use the order already in the input to discard half the search space at every step. LeetCode 88. Merge Sorted Array is filed here on both counts: the reference solution below belongs to the algorithm family this hub collects, and LeetCode tags it Two Pointers.

The two pointers guide has the Python template for the pattern and the 201 LeetCode problems that use it.

Related problems