#两个有序数组,组合成为一个新数组 class Solution: def mergeSortedList(self, A, B): E = [] i, j = 0, 0 while i < len(A) and j < len(B): if A[i] < B[j]: E.append(A[i]) i += 1 else: E.append(B[j]) j += 1 while i < len(A): E.append(A[i]) i += 1 while j < len(B): E.append(B[j]) j += 1 return E solution = Solution() A = [1, 5] B = [1, 2,3] C = [1, 2, 3, 4] D = [2, 4, 8, 9] print(solution.mergeSortedList(A, B)) print(solution.mergeSortedList(C, D)) print(solution.mergeSortedList(A, D))
查看更多关于python编程300例_2、合并排序数组(列表)的详细内容...
声明:本文来自网络,不代表【好得很程序员自学网】立场,转载请注明出处:http://www.haodehen.cn/did126383