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

merge_2_sorted_array.py

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.
        """
        r = len(nums1) - 1
        i = m - 1
        j = len(nums2) - 1
        
        while i >= 0 and j >= 0:
            if nums1[i] >= nums2[j]:
                nums1[r] = nums1[i]
                i -= 1
                r -= 1
            else:
                nums1[r] = nums2[j]
                j -= 1
                r -= 1
        while j >= 0:
            nums1[r] = nums2[j]
            r -= 1
            j -= 1