题解 | #合并两个有序的数组#
合并两个有序的数组
https://www.nowcoder.com/practice/89865d4375634fc484f3a24b7fe65665
# # # @param A int整型一维数组 # @param B int整型一维数组 # @return void # # 依次保存最大值 class Solution: def merge(self , A, m, B, n): i, j, count = m-1, n-1, m+n-1 while i >= 0 and j >= 0: if A[i] > B[j]: A[count] = A[i] i -= 1 count -= 1 else: A[count] = B[j] j -= 1 count -= 1 if j < 0: return while j >= 0: A[count] = B[j] count -= 1 j -= 1