88. Merge Sorted Array

Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array. The number of elements initialized in nums1 and nums2 are m and n respectively. You may assume that nums1 has enough space (size that is equal to m + n) to hold additional elements from nums2

def merge(self, nums1: List[int], m: int, nums2: List[int], n: int) -> None: 
    """ 
    Do not return anything, modify nums1 in-place instead. 
    """ 
    p1 = m - 1 
    p2 = n - 1 
    p = m + n - 1 
        
    while p >= 0: 
        if p2 == -1 or (p1 >= 0 and nums1[p1] >= nums2[p2]): 
            nums1[p] = nums1[p1] 
            p1 -= 1 
        else: 
            nums1[p] = nums2[p2] 
            p2 -= 1
        p -= 1