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-04 11:44:21 +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,110 @@
+/**
+ * File: array_queue.dart
+ * Created Time: 2023-03-28
+ * Author: liuyuxin (gvenusleo@gmail.com)
+ */
+
+/* Queue based on circular array implementation */
+class ArrayQueue {
+  late List<int> _nums; // Array for storing queue elements
+  late int _front; // Front pointer, points to the front of the queue element
+  late int _queSize; // Queue length
+
+  ArrayQueue(int capacity) {
+    _nums = List.filled(capacity, 0);
+    _front = _queSize = 0;
+  }
+
+  /* Get the capacity of the queue */
+  int capaCity() {
+    return _nums.length;
+  }
+
+  /* Get the length of the queue */
+  int size() {
+    return _queSize;
+  }
+
+  /* Check if the queue is empty */
+  bool isEmpty() {
+    return _queSize == 0;
+  }
+
+  /* Enqueue */
+  void push(int _num) {
+    if (_queSize == capaCity()) {
+      throw Exception("Queue is full");
+    }
+    // Use modulo operation to wrap rear around to the head after passing the tail of the array
+    // Add num to the rear of the queue
+    int rear = (_front + _queSize) % capaCity();
+    // Add _num to queue rear
+    _nums[rear] = _num;
+    _queSize++;
+  }
+
+  /* Dequeue */
+  int pop() {
+    int _num = peek();
+    // Move front pointer backward by one position, if it passes the tail, return to array head
+    _front = (_front + 1) % capaCity();
+    _queSize--;
+    return _num;
+  }
+
+  /* Return list for printing */
+  int peek() {
+    if (isEmpty()) {
+      throw Exception("Queue is empty");
+    }
+    return _nums[_front];
+  }
+
+  /* Return Array */
+  List<int> toArray() {
+    // Elements enqueue
+    final List<int> res = List.filled(_queSize, 0);
+    for (int i = 0, j = _front; i < _queSize; i++, j++) {
+      res[i] = _nums[j % capaCity()];
+    }
+    return res;
+  }
+}
+
+/* Driver Code */
+void main() {
+  /* Access front of the queue element */
+  final int capacity = 10;
+  final ArrayQueue queue = ArrayQueue(capacity);
+
+  /* Elements enqueue */
+  queue.push(1);
+  queue.push(3);
+  queue.push(2);
+  queue.push(5);
+  queue.push(4);
+  print("Queue queue = ${queue.toArray()}");
+
+  /* Return list for printing */
+  final int peek = queue.peek();
+  print("Front element peek = $peek");
+
+  /* Element dequeue */
+  final int pop = queue.pop();
+  print("Dequeue element pop = $pop, after dequeue queue = ${queue.toArray()}");
+
+  /* Get queue length */
+  final int size = queue.size();
+  print("Queue length size = $size");
+
+  /* Check if the queue is empty */
+  final bool isEmpty = queue.isEmpty();
+  print("Is queue empty = $isEmpty");
+
+  /* Test circular array */
+  for (int i = 0; i < 10; i++) {
+    queue.push(i);
+    queue.pop();
+    print("After round $i enqueue + dequeue, queue = ${queue.toArray()}");
+  }
+}