归并排序

def solve():
    def mergeSort(____):
        if len(____) <= ____:
            return nums
        mid = len(____) // ____
        left = mergeSort(____)
        right = mergeSort(____)
        result = []
        i = j = ____
        while i < len(____) and j < len(____):
            if left[i] <= right[j]:
                result.append(____)
                i += ____
            else:
                result.append(____)
                j += ____
        result.extend(____)
        result.extend(____)
        return result
    nums = [____, ____, ____, ____]
    print(mergeSort(____))