Translate all code to English (#1836)

* 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
2026-07-22 11:26:07 +00:00 · 2025-12-31 07:44:52 +08:00
parent 45e1295241
commit 2778a6f9c7
1284 changed files with 71557 additions and 3275 deletions
@@ -0,0 +1,58 @@
+/**
+ * File: top_k.js
+ * Created Time: 2023-08-13
+ * Author: Justin (xiefahit@gmail.com)
+ */
+
+const { MaxHeap } = require('./my_heap');
+
+/* Element enters heap */
+function pushMinHeap(maxHeap, val) {
+    // Negate element
+    maxHeap.push(-val);
+}
+
+/* Element exits heap */
+function popMinHeap(maxHeap) {
+    // Negate element
+    return -maxHeap.pop();
+}
+
+/* Access top element */
+function peekMinHeap(maxHeap) {
+    // Negate element
+    return -maxHeap.peek();
+}
+
+/* Extract elements from heap */
+function getMinHeap(maxHeap) {
+    // Negate element
+    return maxHeap.getMaxHeap().map((num) => -num);
+}
+
+/* Find the largest k elements in array based on heap */
+function topKHeap(nums, k) {
+    // Python's heapq module implements min heap by default
+    // Note: We negate all heap elements to simulate min heap using max heap
+    const maxHeap = new MaxHeap([]);
+    // Enter the first k elements of array into heap
+    for (let i = 0; i < k; i++) {
+        pushMinHeap(maxHeap, nums[i]);
+    }
+    // Starting from the (k+1)th element, maintain heap length as k
+    for (let i = k; i < nums.length; i++) {
+        // If current element is greater than top element, top element exits heap, current element enters heap
+        if (nums[i] > peekMinHeap(maxHeap)) {
+            popMinHeap(maxHeap);
+            pushMinHeap(maxHeap, nums[i]);
+        }
+    }
+    // Return elements in heap
+    return getMinHeap(maxHeap);
+}
+
+/* Driver Code */
+const nums = [1, 7, 6, 3, 2];
+const k = 3;
+const res = topKHeap(nums, k);
+console.log(`The largest ${k} elements are`, res);