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-09 05:56:06 +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,148 @@
+/**
+ * File: array_deque.swift
+ * Created Time: 2023-02-22
+ * Author: nuomi1 (nuomi1@qq.com)
+ */
+
+/* Double-ended queue based on circular array implementation */
+class ArrayDeque {
+    private var nums: [Int] // Array for storing double-ended queue elements
+    private var front: Int // Front pointer, points to the front of the queue element
+    private var _size: Int // Double-ended queue length
+
+    /* Constructor */
+    init(capacity: Int) {
+        nums = Array(repeating: 0, count: capacity)
+        front = 0
+        _size = 0
+    }
+
+    /* Get the capacity of the double-ended queue */
+    func capacity() -> Int {
+        nums.count
+    }
+
+    /* Get the length of the double-ended queue */
+    func size() -> Int {
+        _size
+    }
+
+    /* Check if the double-ended queue is empty */
+    func isEmpty() -> Bool {
+        size() == 0
+    }
+
+    /* Calculate circular array index */
+    private func index(i: Int) -> Int {
+        // Use modulo operation to wrap the array head and tail together
+        // When i passes the tail of the array, return to the head
+        // When i passes the head of the array, return to the tail
+        (i + capacity()) % capacity()
+    }
+
+    /* Front of the queue enqueue */
+    func pushFirst(num: Int) {
+        if size() == capacity() {
+            print("Double-ended queue is full")
+            return
+        }
+        // Use modulo operation to wrap front around to the tail after passing the head of the array
+        // Add num to the front of the queue
+        front = index(i: front - 1)
+        // Add num to front of queue
+        nums[front] = num
+        _size += 1
+    }
+
+    /* Rear of the queue enqueue */
+    func pushLast(num: Int) {
+        if size() == capacity() {
+            print("Double-ended queue is full")
+            return
+        }
+        // Use modulo operation to wrap rear around to the head after passing the tail of the array
+        let rear = index(i: front + size())
+        // Front pointer moves one position backward
+        nums[rear] = num
+        _size += 1
+    }
+
+    /* Rear of the queue dequeue */
+    func popFirst() -> Int {
+        let num = peekFirst()
+        // Move front pointer backward by one position
+        front = index(i: front + 1)
+        _size -= 1
+        return num
+    }
+
+    /* Access rear of the queue element */
+    func popLast() -> Int {
+        let num = peekLast()
+        _size -= 1
+        return num
+    }
+
+    /* Return list for printing */
+    func peekFirst() -> Int {
+        if isEmpty() {
+            fatalError("Deque is empty")
+        }
+        return nums[front]
+    }
+
+    /* Driver Code */
+    func peekLast() -> Int {
+        if isEmpty() {
+            fatalError("Deque is empty")
+        }
+        // Initialize double-ended queue
+        let last = index(i: front + size() - 1)
+        return nums[last]
+    }
+
+    /* Return array for printing */
+    func toArray() -> [Int] {
+        // Elements enqueue
+        (front ..< front + size()).map { nums[index(i: $0)] }
+    }
+}
+
+@main
+enum _ArrayDeque {
+    /* Driver Code */
+    static func main() {
+        /* Get the length of the double-ended queue */
+        let deque = ArrayDeque(capacity: 10)
+        deque.pushLast(num: 3)
+        deque.pushLast(num: 2)
+        deque.pushLast(num: 5)
+        print("Deque deque = \(deque.toArray())")
+
+        /* Update element */
+        let peekFirst = deque.peekFirst()
+        print("Front element peekFirst = \(peekFirst)")
+        let peekLast = deque.peekLast()
+        print("Rear element peekLast = \(peekLast)")
+
+        /* Elements enqueue */
+        deque.pushLast(num: 4)
+        print("After element 4 enqueues at rear, deque = \(deque.toArray())")
+        deque.pushFirst(num: 1)
+        print("After element 1 enqueues at front, deque = \(deque.toArray())")
+
+        /* Element dequeue */
+        let popLast = deque.popLast()
+        print("Dequeue rear element = \(popLast), after rear dequeue deque = \(deque.toArray())")
+        let popFirst = deque.popFirst()
+        print("Dequeue front element = \(popFirst), after front dequeue deque = \(deque.toArray())")
+
+        /* Get the length of the double-ended queue */
+        let size = deque.size()
+        print("Deque length size = \(size)")
+
+        /* Check if the double-ended queue is empty */
+        let isEmpty = deque.isEmpty()
+        print("Is deque empty = \(isEmpty)")
+    }
+}