CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-11-11 08:20:38 +08:00
Code Issues Packages Projects Releases Wiki Activity

Retranslate the complete English edition from Simplified Chinese (#2010)

Browse Source 
* Retranslate the complete English edition from Simplified Chinese

* Polish three English explanations after reader-focused review
This commit is contained in:
Yudong Jin
2026-10-31 03:35:51 +08:00
committed by GitHub
parent ef46e2ed95
commit 14c314c08c
1502 changed files with 29459 additions and 23517 deletions
Download Patch File Download Diff File Expand all files Collapse all files

38
en/codes/java/chapter_heap/heap.java
View File

@@ -11,56 +11,56 @@ import java.util.*;
public class heap {
public static void testPush(Queue<Integer> heap, int val) {
heap.offer(val); // Element enters heap
System.out.format("\nAfter element %d enters heap\n", val);
heap.offer(val); // Push an element onto the heap
System.out.format("\nAfter pushing %d onto the heap:\n", val);
PrintUtil.printHeap(heap);
}
public static void testPop(Queue<Integer> heap) {
int val = heap.poll(); // Time complexity is O(n), not O(nlogn)
System.out.format("\nAfter heap top element %d exits heap\n", val);
int val = heap.poll(); // Pop the top element from the heap
System.out.format("\nAfter popping the top element %d:\n", val);
PrintUtil.printHeap(heap);
}
public static void main(String[] args) {
/* Initialize heap */
// Python's heapq module implements min heap by default
/* Initialize heaps */
// Initialize a min heap
Queue<Integer> minHeap = new PriorityQueue<>();
// Initialize max heap (modify Comparator using lambda expression)
// Initialize a max heap by supplying a lambda expression as the Comparator
Queue<Integer> maxHeap = new PriorityQueue<>((a, b) -> b - a);
System.out.println("\nThe following test cases are for max heap");
System.out.println("\nThe following example uses a max heap");
/* Element enters heap */
/* Push an element onto the heap */
testPush(maxHeap, 1);
testPush(maxHeap, 3);
testPush(maxHeap, 2);
testPush(maxHeap, 5);
testPush(maxHeap, 4);
/* Check if heap is empty */
/* Get the top element of the heap */
int peek = maxHeap.peek();
System.out.format("\nHeap top element is %d\n", peek);
System.out.format("\nTop element: %d\n", peek);
/* Time complexity is O(n), not O(nlogn) */
/* Pop the top element from the heap */
testPop(maxHeap);
testPop(maxHeap);
testPop(maxHeap);
testPop(maxHeap);
testPop(maxHeap);
/* Get heap size */
/* Get the heap size */
int size = maxHeap.size();
System.out.format("\nHeap element count is %d\n", size);
System.out.format("\nNumber of elements in the heap: %d\n", size);
/* Check if heap is empty */
/* Check whether the heap is empty */
boolean isEmpty = maxHeap.isEmpty();
System.out.format("\nHeap is empty %b\n", isEmpty);
System.out.format("\nIs the heap empty? %b\n", isEmpty);
/* Input list and build heap */
// Time complexity is O(n), not O(nlogn)
/* Build a heap from an input list */
// The time complexity is O(n), not O(nlogn)
minHeap = new PriorityQueue<>(Arrays.asList(1, 3, 2, 5, 4));
System.out.println("\nAfter inputting list and building min heap");
System.out.println("\nAfter building a min heap from the input list:");
PrintUtil.printHeap(minHeap);
}
}