LeetCode 088 Merge Sorted Array

class Solution(object):
    def merge(self, nums1, m, nums2, n):
        """
        :type nums1: List[int]
        :type m: int
        :type nums2: List[int]
        :type n: int
        :rtype: void Do not return anything, modify nums1 in-place instead.
        """
        p1, p2 = m - 1, n - 1
        pos = m + n - 1
        while p1 >= 0 and p2 >= 0:
            if nums1[p1] >= nums2[p2]:
                nums1[pos] = nums1[p1]
                p1 -= 1
            else:
                nums1[pos] = nums2[p2]
                p2 -= 1
            pos -= 1
        while p2 >= 0:
            nums1[pos] = nums2[p2]
            p2 -= 1
            pos -= 1

    # def merge(self, nums1, m, nums2, n):
    #     # using slicing
    #     i, j, k = m - 1, n - 1, m + n - 1
    #     while i >= 0 and j >= 0:
    #         if nums1[i] > nums2[j]:
    #             nums1[k] = nums1[i]
    #             i -= 1
    #         else:
    #             nums1[k] = nums2[j]
    #             j -= 1
    #         k -= 1
    #
    #     if j >= 0:
    #         nums1[:k + 1] = nums2[:j + 1]