algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-12-19 07:17:54 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update heap.

Browse Source
This commit is contained in:
Yudong Jin
2023-01-12 04:08:45 +08:00
parent 5ab3513b5a
commit 3abcefae99
24 changed files with 112 additions and 61 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
codes/java/chapter_heap/heap.java
View File

@@ -13,13 +13,13 @@ import java.util.*;
public class heap {
public static void testPush(Queue<Integer> heap, int val) {
heap.add(val); // 元素入堆
System.out.format("\n添加元素 %d 后\n", val);
System.out.format("\n元素 %d 入堆后\n", val);
PrintUtil.printHeap(heap);
}
public static void testPoll(Queue<Integer> heap) {
int val = heap.poll(); // 堆顶元素出堆
System.out.format("\n出堆元素为 %d\n", val);
System.out.format("\n堆顶元素 %d 出堆后\n", val);
PrintUtil.printHeap(heap);
}
@@ -46,6 +46,9 @@ public class heap {
/* 堆顶元素出堆 */
testPoll(maxHeap);
testPoll(maxHeap);
testPoll(maxHeap);
testPoll(maxHeap);
testPoll(maxHeap);
/* 获取堆大小 */
int size = maxHeap.size();
@@ -58,7 +61,7 @@ public class heap {
/* 输入列表并建堆 */
// 时间复杂度为 O(n) ，而非 O(nlogn)
minHeap = new PriorityQueue<>(Arrays.asList(1, 3, 2, 5, 4));
System.out.println("\n输入 [1, 3, 2, 5, 4] ，建立小顶堆");
System.out.println("\n输入列表并建立小顶堆后");
PrintUtil.printHeap(minHeap);
}
}

32
codes/java/chapter_heap/my_heap.java
View File

@@ -146,26 +146,25 @@ public class my_heap {
}
public static void main(String[] args) {
/* 初始化堆 */
// 初始化大顶堆
MaxHeap maxHeap = new MaxHeap();
System.out.println("\n以下测试样例为大顶堆");
/* 元素入堆 */
testPush(maxHeap, 1);
testPush(maxHeap, 3);
testPush(maxHeap, 2);
testPush(maxHeap, 5);
testPush(maxHeap, 4);
/* 初始化大顶堆 */
MaxHeap maxHeap = new MaxHeap(Arrays.asList(9, 8, 6, 6, 7, 5, 2, 1, 4, 3, 6, 2));
System.out.println("\n输入列表并建堆后");
maxHeap.print();
/* 获取堆顶元素 */
int peek = maxHeap.peek();
System.out.format("\n堆顶元素为 %d\n", peek);
/* 元素入堆 */
int val = 7;
maxHeap.push(val);
System.out.format("\n元素 %d 入堆后\n", val);
maxHeap.print();
/* 堆顶元素出堆 */
testPoll(maxHeap);
testPoll(maxHeap);
peek = maxHeap.poll();
System.out.format("\n堆顶元素 %d 出堆后\n", peek);
maxHeap.print();
/* 获取堆大小 */
int size = maxHeap.size();
@@ -174,10 +173,5 @@ public class my_heap {
/* 判断堆是否为空 */
boolean isEmpty = maxHeap.isEmpty();
System.out.format("\n堆是否为空 %b\n", isEmpty);
/* 将输入列表堆化 */
maxHeap = new MaxHeap(Arrays.asList(1, 3, 2, 5, 4));
System.out.println("\n输入 [1, 3, 2, 5, 4] ，建立大顶堆");
maxHeap.print();
}
}