xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-06-28 16:44:22 +00: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
en/codes/java/chapter_stack_and_queue/array_stack.java
+14 -14
View File
@@ -8,12 +8,12 @@ package chapter_stack_and_queue;
import java.util.*;
/* Stack class based on array */
/* Stack based on array implementation */
class ArrayStack {
private ArrayList<Integer> stack;
public ArrayStack() {
// Initialize the list (dynamic array)
// Initialize list (dynamic array)
stack = new ArrayList<>();
}
@@ -22,7 +22,7 @@ class ArrayStack {
return stack.size();
}
/* Determine if the stack is empty */
/* Check if the stack is empty */
public boolean isEmpty() {
return size() == 0;
}
@@ -39,14 +39,14 @@ class ArrayStack {
return stack.remove(size() - 1);
}
/* Access stack top element */
/* Return list for printing */
public int peek() {
if (isEmpty())
throw new IndexOutOfBoundsException();
return stack.get(size() - 1);
}
/* Convert the List to Array and return */
/* Convert List to Array and return */
public Object[] toArray() {
return stack.toArray();
}
@@ -54,10 +54,10 @@ class ArrayStack {
public class array_stack {
public static void main(String[] args) {
/* Initialize stack */
/* Access top of the stack element */
ArrayStack stack = new ArrayStack();
/* Element push */
/* Elements push onto stack */
stack.push(1);
stack.push(3);
stack.push(2);
@@ -65,20 +65,20 @@ public class array_stack {
stack.push(4);
System.out.println("Stack stack = " + Arrays.toString(stack.toArray()));
/* Access stack top element */
/* Return list for printing */
int peek = stack.peek();
System.out.println("Top element peek = " + peek);
System.out.println("Stack top element peek = " + peek);
/* Element pop */
/* Element pop from stack */
int pop = stack.pop();
System.out.println("Popped element = " + pop + ", after popping" + Arrays.toString(stack.toArray()));
System.out.println("Pop element pop = " + pop + ", after pop, stack = " + Arrays.toString(stack.toArray()));
/* Get the length of the stack */
int size = stack.size();
System.out.println("Length of the stack size = " + size);
System.out.println("Stack length size = " + size);
/* Determine if it's empty */
/* Check if empty */
boolean isEmpty = stack.isEmpty();
System.out.println("Is the stack empty = " + isEmpty);
System.out.println("Stack is empty = " + isEmpty);
}
}