题解 | #合并两个有序的数组#

#
# 
# @param A int整型一维数组 
# @param B int整型一维数组 
# @return void
#
class Solution:
    def merge(self , A, m, B, n):
        # write code here
        # 双指针
        cur = m+n-1
        i = m - 1
        j = n - 1
        while i >= 0 and j >= 0:
            if A[i] > B[j]:
                A[cur] = A[i]
                i -= 1
            else:
                A[cur] = B[j]
                j -= 1
            cur -= 1
        while i>=0:
            A[cur] = A[i]
            i-=1;cur-=1
        while j>=0:
            A[cur] = B[j]
            j-=1;cur-=1