<doocs>0088.Merge Sorted Array_1.py
def merge( nums1: List[int], m: int, nums2: List[int], n: int) -> None:
    i, j, k = m - 1, n - 1, m + 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
def sample_funcname ( var_0 : List [ int ] , var_3 : int , var_4 : List [ int ] , var_5 : int ) -> None :
    var_8 , var_9 , var_10 = var_3 - 1 , var_5 - 1 , var_3 + var_5 - 1
    while var_9 >= 0 :
        if var_8 >= 0 and var_0 [ var_8 ] > var_4 [ var_9 ] :
            var_0 [ var_10 ] = var_0 [ var_8 ]
            var_8 -= 1
        else :
            var_0 [ var_10 ] = var_4 [ var_9 ]
            var_9 -= 1
        var_10 -= 1
