class Solution:
"""
@param: A: sorted integer array A which has m elements, but size of A is m+n
@param: m: An integer
@param: B: sorted integer array B which has n elements
@param: n: An integer
@return: nothing
"""
def mergeSortedArray(self, A, m, B, n):
# write your code here
#不用sort()解法
#初始化
poionA, poionB = m - 1, n - 1
index = m + n - 1
#反向每次取最大
#当两个数组可以相互比较最后一个值的大小的时候
while poionA != -1 and poionB != -1:
if (A[poionA] > B[poionB]):
A[index] = A[poionA]
poionA -= 1else:
A[index] = B[poionB]
poionB -= 1
index -= 1
#最后剩下的直接加进来
while poionA != -1:
A[index] = A[poionA]
index -= 1
poionA -= 1while poionB != -1:
A[index] = B[poionB]
index -= 1
poionB -= 1return A