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/cpp/chapter_stack_and_queue/array_stack.cpp
+12 -12
View File
@@ -6,7 +6,7 @@
#include "../utils/common.hpp"
/* Stack class based on array */
/* Stack based on array implementation */
class ArrayStack {
private:
vector<int> stack;
@@ -17,7 +17,7 @@ class ArrayStack {
return stack.size();
}
/* Determine if the stack is empty */
/* Check if the stack is empty */
bool isEmpty() {
return stack.size() == 0;
}
@@ -34,7 +34,7 @@ class ArrayStack {
return num;
}
/* Access stack top element */
/* Return list for printing */
int top() {
if (isEmpty())
throw out_of_range("Stack is empty");
@@ -49,10 +49,10 @@ class ArrayStack {
/* Driver Code */
int main() {
/* 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);
@@ -61,22 +61,22 @@ int main() {
cout << "Stack stack = ";
printVector(stack->toVector());
/* Access stack top element */
/* Return list for printing */
int top = stack->top();
cout << "Top element of the stack top = " << top << endl;
cout << "Stack top element top = " << top << endl;
/* Element pop */
/* Element pop from stack */
top = stack->pop();
cout << "Element popped from the stack = " << top << ", after popping";
cout << "Pop element pop = " << top << ", after pop, stack = ";
printVector(stack->toVector());
/* Get the length of the stack */
int size = stack->size();
cout << "Length of the stack size = " << size << endl;
cout << "Stack length size = " << size << endl;
/* Determine if it's empty */
/* Check if empty */
bool empty = stack->isEmpty();
cout << "Is the stack empty = " << empty << endl;
cout << "Stack is empty = " << empty << endl;
// Free memory
delete stack;