CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-07 04:30:43 +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

32
en/codes/python/chapter_stack_and_queue/deque.py
View File

@@ -11,32 +11,32 @@ if __name__ == "__main__":
# Initialize double-ended queue
deq: deque[int] = deque()
# Element enqueue
deq.append(2) # Add to rear
# Elements enqueue
deq.append(2) # Add to the rear of the queue
deq.append(5)
deq.append(4)
deq.appendleft(3) # Add to front
deq.appendleft(3) # Add to the front of the queue
deq.appendleft(1)
print("Double-ended queue deque =", deq)
print("double-ended queue deque =", deq)
# Access element
front: int = deq[0] # Front element
print("Front element front =", front)
rear: int = deq[-1] # Rear element
print("Rear element rear =", rear)
# Access elements
front: int = deq[0] # Front of the queue element
print("Front of the queue element front =", front)
rear: int = deq[-1] # Rear of the queue element
print("Rear of the queue element rear =", rear)
# Element dequeue
pop_front: int = deq.popleft() # Front element dequeue
# Elements dequeue
pop_front: int = deq.popleft() # Front of the queue element dequeues
print("Front dequeued element pop_front =", pop_front)
print("Deque after front dequeue =", deq)
pop_rear: int = deq.pop() # Rear element dequeue
print("After front dequeue deque =", deq)
pop_rear: int = deq.pop() # Rear of the queue element dequeues
print("Rear dequeued element pop_rear =", pop_rear)
print("Deque after rear dequeue =", deq)
print("After rear dequeue deque =", deq)
# Get the length of the double-ended queue
size: int = len(deq)
print("Double-ended queue length size =", size)
print("Length of the double-ended queue size =", size)
# Determine if the double-ended queue is empty
# Check if the double-ended queue is empty
is_empty: bool = len(deq) == 0
print("Is the double-ended queue empty =", is_empty)