[Leetcode]Merge Sorted Array

Given two sorted integer arrays A and B, merge B into A as one sorted array.

Note:

You may assume that A has enough space (size that is greater or equal to m + n) to hold additional elements from B. The number of elements initialized in A and B are m and n respectively.

把有序数组B merge 到有序数组A中~因为结果存放到A数组中，所以我们可以从后往前扫描A和B~ 时间复杂度是O(m+n)

class Solution:
    # @param A  a list of integers
    # @param m  an integer, length of A
    # @param B  a list of integers
    # @param n  an integer, length of B
    # @return nothing
    def merge(self, A, m, B, n):
        if A is None or B is None: return
        p1, p2, p3 = m - 1, n - 1, m + n - 1
        while p1 >= 0 and p2 >= 0:
            if A[p1] > B[p2]:
                A[p3] = A[p1]
                p1 -= 1
            else:
                A[p3] = B[p2]
                p2 -= 1
            p3 -= 1
        while p2 >= 0:
            A[p3] = B[p2]
            p3 -= 1; p2 -= 1