Merge Sorted Array - LeetCode
題目:
Given two sorted integer arrays A and B, merge B into A as one sorted array.
分析:
這裡要注意的是這裡處理list不能用append,我猜想是在一開始時A的真是長度就是m+n,是以你用append時,最後部分都将會0。
代碼:
def merge(self, A, m, B, n):
if m == 0:
A[0:n] = B[0:n]
elif n == 0:
return
else:
i,j = 0,0
if B[0] >= A[m-1]:
A[m:] = B[0:n]
return
while j < len(A) and i < n:
if B[i] <= A[j]:
A.insert(j,B[i])
i+=1
j +=1
A[m+i:] = B[i:]