python编程300例之例2

class Solution:
    def mergeAndSort(self, A, B):
        # A, B为输入的两个升序列表
        ls = []
        i = 0
        j = 0
        while i < len(A) and j < len(B):
            if A[i] <= B[j]:
                ls.append(A[i])
                i += 1
            else:
                ls.append(B[j])
                j += 1
        while i < len(A):
            ls.append(A[i])
            i += 1
        while j < len(B):
            ls.append(B[j])
            j += 1
        return ls

if __name__ == '__main__':
    solution = Solution()
    A = [2, 5, 6]
    B = [1, 1, 2, 3, 5, 7]
    C = [1, 2, 3, 4]
    D = [2, 4, 5, 6]
    print(f"列表A{A}和列表B{B}的结果：{solution.mergeAndSort(A, B)}")
    print(f"列表C{C}和列表D{D}的结果：{solution.mergeAndSort(C, D)}")
    E = input("请输入列表D:")
    E = [int(x) for x in E.split(',')]
    F = input("请输入列表F:")
    F = [int(x) for x in F.split(',')]
    print(f"列表E{E}和列表F{F}的结果：{solution.mergeAndSort(E, F)}")