CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-15 02:40:58 +08:00
Code Issues Packages Projects Releases Wiki Activity

Translate all code to English (#1836)

Browse Source 
* Review the EN heading format.

* Fix pythontutor headings.

* Fix pythontutor headings.

* bug fixes

* Fix headings in **/summary.md

* Revisit the CN-to-EN translation for Python code using Claude-4.5

* Revisit the CN-to-EN translation for Java code using Claude-4.5

* Revisit the CN-to-EN translation for Cpp code using Claude-4.5.

* Fix the dictionary.

* Fix cpp code translation for the multipart strings.

* Translate Go code to English.

* Update workflows to test EN code.

* Add EN translation for C.

* Add EN translation for CSharp.

* Add EN translation for Swift.

* Trigger the CI check.

* Revert.

* Update en/hash_map.md

* Add the EN version of Dart code.

* Add the EN version of Kotlin code.

* Add missing code files.

* Add the EN version of JavaScript code.

* Add the EN version of TypeScript code.

* Fix the workflows.

* Add the EN version of Ruby code.

* Add the EN version of Rust code.

* Update the CI check for the English version  code.

* Update Python CI check.

* Fix cmakelists for en/C code.

* Fix Ruby comments
This commit is contained in:
Yudong Jin
2025-12-31 07:44:52 +08:00
committed by GitHub
parent 45e1295241
commit 2778a6f9c7
1284 changed files with 71557 additions and 3275 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -11,38 +11,38 @@ import java.util.*;
public class heap {
public static void testPush(Queue<Integer> heap, int val) {
heap.offer(val); // Push the element into heap
System.out.format("\nAfter element %d is added to the heap\n", val);
heap.offer(val); // Element enters heap
System.out.format("\nAfter element %d enters heap\n", val);
PrintUtil.printHeap(heap);
}
public static void testPop(Queue<Integer> heap) {
int val = heap.poll(); // Pop the element at the heap top
System.out.format("\nAfter the top element %d is removed from the heap\n", val);
int val = heap.poll(); // Time complexity is O(n), not O(nlogn)
System.out.format("\nAfter heap top element %d exits heap\n", val);
PrintUtil.printHeap(heap);
}
public static void main(String[] args) {
/* Initialize the heap */
// Initialize min-heap
/* Initialize heap */
// Python's heapq module implements min heap by default
Queue<Integer> minHeap = new PriorityQueue<>();
// Initialize the max-heap (using lambda expression to modify Comparator if necessary)
// Initialize max heap (modify Comparator using lambda expression)
Queue<Integer> maxHeap = new PriorityQueue<>((a, b) -> b - a);
System.out.println("\nThe following test case is for max-heap");
System.out.println("\nThe following test cases are for max heap");
/* Push the element into heap */
/* Element enters heap */
testPush(maxHeap, 1);
testPush(maxHeap, 3);
testPush(maxHeap, 2);
testPush(maxHeap, 5);
testPush(maxHeap, 4);
/* Access heap top element */
/* Check if heap is empty */
int peek = maxHeap.peek();
System.out.format("\nTop element of the heap is %d\n", peek);
System.out.format("\nHeap top element is %d\n", peek);
/* Pop the element at the heap top */
/* Time complexity is O(n), not O(nlogn) */
testPop(maxHeap);
testPop(maxHeap);
testPop(maxHeap);
@@ -51,16 +51,16 @@ public class heap {
/* Get heap size */
int size = maxHeap.size();
System.out.format("\nNumber of elements in the heap is %d\n", size);
System.out.format("\nHeap element count is %d\n", size);
/* Determine if heap is empty */
/* Check if heap is empty */
boolean isEmpty = maxHeap.isEmpty();
System.out.format("\nIs the heap empty %b\n", isEmpty);
System.out.format("\nHeap is empty %b\n", isEmpty);
/* Enter list and build heap */
/* Input list and build heap */
// Time complexity is O(n), not O(nlogn)
minHeap = new PriorityQueue<>(Arrays.asList(1, 3, 2, 5, 4));
System.out.println("\nEnter list and build min-heap");
System.out.println("\nAfter inputting list and building min heap");
PrintUtil.printHeap(minHeap);
}
}