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