堆实现的优先级队列的主要方法说明:
(1)HEAP_MAXIMUM(int[] a) 返回中具有最大关键字的元素
(2)HEAP_EXTRACT_MAX(int[] a) 去掉并返回具有最大关键字的元素
(3)HEAP_INCREASE_KEY(int a[],int i,int k) 将第i个元素的关键字值增加到k,k不能小于x的原关键字的值
(4)MAX_HEAP_INSERT(int[] a,int k) 插入关键字值为k的新元素
正确理解a.length和heap_size:
a.length是数组元素中元素的个数,heap_size是存放在a中堆的元素个数。就是说虽然a[0,a.length-1]中都可以包含有效值,但a[heap_size-1] 后的元素都不属于相应的堆,此处heap_size <= a.length
注:这句话是摘自算法导论,代码也是按算法导论实现的。这里博主为了省事,没用可变长度数组,所以直接运行MAX_HEAP_INSERT方法是会报错的,所以得先返回并删除一个最大值,也就是先调用一次HEAP_EXTRACT_MAX
注2:按照这程序运行的第三个输出为:
14 8 10 4 7 9 3 2 1 1
最后的数字1并不是堆中的,这点已经在“正确理解a.length和heap_size”这部分解释过了,希望能好好理解
package zsy.com;
public class HeapSortMethod {
private static int heap_size;
public static void main(String[] args) {
BUILD_MAX_HEAP(a);
int max = HEAP_MAXIMUM(a);
System.out.println("Tne max: "+max);
int max2 = HEAP_EXTRACT_MAX(a);
System.out.println("Tne max2: "+max2);
for(int i:a){
System.out.print(i+" ");
}
System.out.println(" ");
MAX_HEAP_INSERT(a, 15);
for(int i:a){
System.out.print(i+" ");
}
}
public static void MAX_HEAPIFY(int[] a,int i){
int largest = 0;
int l = i*2+1;
int r = i*2+2;
if(l < heap_size && a[i] < a[l]){
largest = l;
}else{
largest = i;
}
if(r < heap_size && a[largest] < a[r]){
largest = r;
}
if(largest!=i){
swap(a,largest,i);
MAX_HEAPIFY(a,largest);
}
}
public static void BUILD_MAX_HEAP(int[] a){
heap_size = a.length;
for(int i=a.length-1;i>=0;i--){
MAX_HEAPIFY(a,i);
}
}
public static void swap(int[] a,int i,int j){
a[i] = a[i] ^ a[j];
a[j] = a[i] ^ a[j];
a[i] = a[i] ^ a[j];
}
//............................................
public static int HEAP_MAXIMUM(int[] a){
return a[0];
}
public static int HEAP_EXTRACT_MAX(int[] a){
int max;
if(heap_size < 1)
System.out.println("Heap Underflow!");
max = a[0];
a[0] = a[heap_size-1];
heap_size -= 1;
MAX_HEAPIFY(a,0);
return max;
}
public static void HEAP_INCREASE_KEY(int[] a,int i,int k){
if(k < a[i])
System.out.println("New key is smaller than current key!");
a[i] = k;
while(i>0 && a[(i-1)/2] < a[i]){
swap(a,i,(i-1)/2);
i = (i-1)/2;
}
}
public static void MAX_HEAP_INSERT(int[] a,int k){
heap_size += 1;
a[heap_size-1] = -30000;
HEAP_INCREASE_KEY(a, heap_size-1, k);
}
}
<pre name="code" class="java">