摘要：def quick_sort(alist, start, end): if start >= end: return None left, right = start, end value = alist[left] while left < right: # [1, 4, 2, 5, 0, 3, 阅读全文

摘要：def buildMaxHeap(arr): import math for i in range(math.floor(len(arr)/2),-1,-1): heapify(arr,i) def heapify(arr, i): left = 2*i+1 right = 2*i+2 larges 阅读全文

摘要：# -*- coding:utf-8 -*- import copy class ZuHeTree: def __init__(self, a_list): self.a_list = a_list self.list_size = len(a_list) self.result = [] self 阅读全文