摘要： def mergeSort(nums): if len(nums) <= 1: return nums mid = len(nums)//2 first = mergeSort(nums[:mid]) second = mergeSort(nums[mid:]) merge = [] while f 阅读全文