i, lastNodeIndex);34}35}3637//实现一个小顶堆38privatestaticvoidminHeapify(int[] numbers,intcurrentIndex,intlastNodeIndex) {39intleftChildIndex, rightChildIndex, smallestIndex;40while(true) {41leftChildIndex = currentIndex * 2 + 1;42rightChildIndex = leftChildIndex + 1;43smallest...