合并两个排序的整数数组 A 和 B,变成一个新的排序数组
参考代码:
class Solution: def mergeSortedArray(self, A, m, B, n): i, j = m - 1, n - 1 t = len(A) - 1 while i >= 0 or j >= 0: if i < 0 or (j >= 0 and B[j] > A[i]): A[t] = B[j] j -= 1 else: A[t] = A[i] i -= 1 t -= 1