88. Merge Sorted Array

88. Merge Sorted Array

Easy

4434428Add to ListShare

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.

Example 1:

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].
The result of the merge is [1,2,2,3,5,6] with the underlined elements coming from nums1.

Example 2:

Input: nums1 = [1], m = 1, nums2 = [], n = 0
Output: [1]
Explanation: The arrays we are merging are [1] and [].
The result of the merge is [1].

Example 3:

Input: nums1 = [0], m = 0, nums2 = [1], n = 1
Output: [1]
Explanation: The arrays we are merging are [] and [1].
The result of the merge is [1].
Note that because m = 0, there are no elements in nums1. The 0 is only there to ensure the merge result can fit in nums1.

Constraints:

• nums1.length == m + n
• nums2.length == n
• 0 <= m, n <= 200
• 1 <= m + n <= 200
• -109 <= nums1[i], nums2[j] <= 109

Follow up: Can you come up with an algorithm that runs in O(m + n) time?

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.

        nums1 = [1, 2, 4, 5, 6, 0]
        Solution().merge(nums1, 5, [3], 1)
        assert nums1 == [1, 2, 3, 4, 5, 6]

        nums1 = [4, 0, 0, 0, 0, 0]
        Solution().merge(nums1, 1, [1, 2, 3, 5, 6], 5)
        assert nums1 == [1, 2, 3, 4, 5, 6]

        nums1 = [1, 2, 3, 0, 0, 0]
        Solution().merge(nums1, 3, [2, 5, 6], 3)
        assert nums1 == [1, 2, 2, 3, 5, 6]

        nums1 = [1, 2, 3, 4, 0, 0]
        Solution().merge(nums1, 4, [2, 2], 2)
        assert nums1 == [1, 2, 2, 2, 3, 4]

        nums1 = [1]
        Solution().merge(nums1, 1, [], 0)
        assert nums1 == [1]

        nums1 = [0]
        Solution().merge(nums1, 0, [1], 1)
        assert nums1 == [1]

        神经病的。这么简单的题目，一开始从左边开始写了好久。
        时间复杂度：O(n+m)，空间复杂度：O(1)
        """

        i1, i2 = m - 1, n - 1
        i = n + m - 1
        while i1 >= 0 and i2 >= 0:
            if nums1[i1] >= nums2[i2]:
                nums1[i] = nums1[i1]
                i1 -= 1
            else:
                nums1[i] = nums2[i2]
                i2 -= 1
            i -= 1
        while i2 >= 0:
            nums1[i] = nums2[i2]
            i -= 1
            i2 -= 1