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-03 11:04:26 +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,107 @@
+=begin
+File: array_queue.rb
+Created Time: 2024-04-05
+Author: Xuan Khoa Tu Nguyen (ngxktuzkai2000@gmail.com)
+=end
+
+### Queue based on circular array ###
+class ArrayQueue
+  ### Get queue length ###
+  attr_reader :size
+
+  ### Constructor ###
+  def initialize(size)
+    @nums = Array.new(size, 0) # Array for storing queue elements
+    @front = 0 # Front pointer, points to the front of the queue element
+    @size = 0 # Queue length
+  end
+
+  ### Get queue capacity ###
+  def capacity
+    @nums.length
+  end
+
+  ### Check if queue is empty ###
+  def is_empty?
+    size.zero?
+  end
+
+  ### Enqueue ###
+  def push(num)
+    raise IndexError, 'Queue is full' if size == capacity
+
+    # 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
+    rear = (@front + size) % capacity
+    # Front pointer moves one position backward
+    @nums[rear] = num
+    @size += 1
+  end
+
+  ### Dequeue ###
+  def pop
+    num = peek
+    # Move front pointer backward by one position, if it passes the tail, return to array head
+    @front = (@front + 1) % capacity
+    @size -= 1
+    num
+  end
+
+  ### Access front element ###
+  def peek
+    raise IndexError, 'Queue is empty' if is_empty?
+
+    @nums[@front]
+  end
+
+  ### Return list for printing ###
+  def to_array
+    res = Array.new(size, 0)
+    j = @front
+
+    for i in 0...size
+      res[i] = @nums[j % capacity]
+      j += 1
+    end
+
+    res
+  end
+end
+
+### Driver Code ###
+if __FILE__ == $0
+  # Access front of the queue element
+  queue = ArrayQueue.new(10)
+
+  # Elements enqueue
+  queue.push(1)
+  queue.push(3)
+  queue.push(2)
+  queue.push(5)
+  queue.push(4)
+  puts "Queue queue = #{queue.to_array}"
+
+  # Return list for printing
+  peek = queue.peek
+  puts "Front element peek = #{peek}"
+
+  # Element dequeue
+  pop = queue.pop
+  puts "Dequeue element pop = #{pop}"
+  puts "After dequeue, queue = #{queue.to_array}"
+
+  # Get the length of the queue
+  size = queue.size
+  puts "Queue length size = #{size}"
+
+  # Check if the queue is empty
+  is_empty = queue.is_empty?
+  puts "Is queue empty = #{is_empty}"
+
+  # Test circular array
+  for i in 0...10
+    queue.push(i)
+    queue.pop
+    puts "After round #{i} of enqueue + dequeue, queue = #{queue.to_array}"
+  end
+end