空间复杂度O(1)时间复杂度O(nlogn)插入:从队尾插入删除:由队尾元素代替然后进行heapadjust();void BuildMaxheap(int num[], int len) { int i = 0; for (i = len / 2;; i--) {//从分支节点开始, HeapAdjust(num,i,len); }}void HeapAdjust(int num[], int k, int len) { num[0] = num[k]; for (int i =k*2 ; i < len; i *= 2) {// if (num[i] < num[i + 1...