题解 | #合并两个有序的数组#
合并两个有序的数组
https://www.nowcoder.com/practice/89865d4375634fc484f3a24b7fe65665
#
#
# @param A int整型一维数组
# @param B int整型一维数组
# @return void
#
class Solution:
def merge(self , A, m, B, n):
# write code here
i = 0
j = n
A[m:] = B
for i in range(m+n):
for j in range(max(i, m), m+n):
if A[i] > A[j]:
A[j], A[i] = A[i], A[j]
埋点都出来了
