leetcode: 88. Merge Sorted Array

Problem

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

AC

class Solution():
    def merge(self, p, m, q, n):
        while m and n:
            if p[m-1] >= q[n-1]:
                p[m+n-1], m = p[m-1], m-1
            else:
                p[m+n-1], n = q[n-1], n-1
        while n:    # 如果是 n=0 而 m!=0，则p[:m]的部分已被排好，无需更改。
            p[n-1], n = q[n-1], n-1


if __name__ == "__main__":
    A = [1, 3, 5, 0, 0, 0, 0]
    B = [2, 4, 6, 7]
    Solution().merge(A, 3, B, 4)
    assert A == [1, 2, 3, 4, 5, 6, 7]