CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-02-03 19:03:42 +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

18
en/codes/python/chapter_stack_and_queue/stack.py
View File

@@ -7,30 +7,30 @@ Author: Peng Chen (pengchzn@gmail.com)
"""Driver Code"""
if __name__ == "__main__":
# Initialize stack
# Python does not have a built-in stack class, but you can use a list as a stack
# Python does not have a built-in stack class, we can use list as a stack
stack: list[int] = []
# Element push
# Elements push onto stack
stack.append(1)
stack.append(3)
stack.append(2)
stack.append(5)
stack.append(4)
print("Stack stack =", stack)
print("stack =", stack)
# Access stack top element
# Access top of the stack element
peek: int = stack[-1]
print("Stack top element peek =", peek)
print("Top of the stack element peek =", peek)
# Element pop
# Element pop from stack
pop: int = stack.pop()
print("Popped element pop =", pop)
print("Stack after pop =", stack)
print("After pop stack =", stack)
# Get the length of the stack
size: int = len(stack)
print("Stack length size =", size)
print("Length of the stack size =", size)
# Determine if it's empty
# Check if it is empty
is_empty: bool = len(stack) == 0
print("Is the stack empty =", is_empty)