class Solution: #参数A: 有序整数数组A #参数B: 有序整数数组B #返回:一个新的有序整数数组 defmergeSortedArray(self, A, B): i, j= 0, 0 C =[] whilei < len(A) and j < len(B): if A[i] < B[j]: C.append(A[i]) i = 1 else: C.append(B[j]) j = 1 whilei < len(A): C.append(A[i]) i = 1 whilej < len(B): C.append(B[j]) j = 1 return C#主函数#主函数if __name__ == '__main__': A = [1,4] B =[1,2,3] D =[1,2,3,4] E =[2,4,5,6] solution= Solution() print("输入:",A, " ", B) print("输出:",solution.mergeSortedArray(A,B)) print("输入:",D, " ", E) print("输出:",solution.mergeSortedArray(D,E))
评论