题目:
这一小节的思路很好,仍然是使用了一个递归,值得注意的是,数组长度的一半这个值恰好是下标最大的非叶节点:
代码如下:
import java.util.Scanner;
public class MaxHeap {
public static void main(String[] args) {
Scanner cin = new Scanner(System.in);
int n = cin.nextInt();
int[] A = new int[n+1];
for (int i=1;i<=n;i++){
A[i] = cin.nextInt();
}
biuldMaxHeap(A);
for (int i=1;i<=n;i++){
System.out.print(A[i] + " ");
}
}
public static void maxHeap(int[] A, int i){
int l = keyLeft(i);
int r = keyRight(i);
int H = A.length-1;
//A[r]右子节点可能不存在,用r_temp来代替这个值
int r_temp;
if(r>H){r_temp = -1;}
else{r_temp = A[r];}
int largest;
//从左子节点、自身、右子节点中选出值最大的节点
if(l <= H && A[l]>A[i]){largest = l;}
else{largest = i;}
if (r <= H && r_temp > A[largest]) {largest = r;}
if(largest != i){//i的子节点值更大时
int temp = A[i];
A[i] = A[largest];
A[largest] = temp;
maxHeap(A, largest);
}
}
public static void biuldMaxHeap(int[] A){
for (int i=(A.length-1)/2;i>=1;i--){
maxHeap(A, i);
}
}
public static int keyLeft(int i){return 2*i;}
public static int keyRight(int i){return 2*i+1;}
}
输入:
10
4 1 3 2 16 9 10 14 8 7
输出:
16 14 10 8 7 9 3 2 4 1