CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-11-10 16:00:36 +08:00
Code Issues Packages Projects Releases Wiki Activity

Retranslate the complete English edition from Simplified Chinese (#2010)

Browse Source 
* Retranslate the complete English edition from Simplified Chinese

* Polish three English explanations after reader-focused review
This commit is contained in:
Yudong Jin
2026-10-31 03:35:51 +08:00
committed by GitHub
parent ef46e2ed95
commit 14c314c08c
1502 changed files with 29459 additions and 23517 deletions
Download Patch File Download Diff File Expand all files Collapse all files

22
en/codes/cpp/chapter_stack_and_queue/stack.cpp
View File

@@ -6,12 +6,12 @@
#include "../utils/common.hpp"
/* Driver Code */
/* Driver code */
int main() {
/* Access top of the stack element */
/* Initialize the stack */
stack<int> stack;
/* Elements push onto stack */
/* Push elements onto the stack */
stack.push(1);
stack.push(3);
stack.push(2);
@@ -20,22 +20,22 @@ int main() {
cout << "Stack stack = ";
printStack(stack);
/* Return list for printing */
/* Access the top element */
int top = stack.top();
cout << "Stack top element top = " << top << endl;
cout << "Top element top = " << top << endl;
/* Element pop from stack */
/* Pop an element from the stack */
stack.pop(); // No return value
cout << "Pop element pop = " << top << ", after pop, stack = ";
cout << "Popped element pop = " << top << "; after popping, stack = ";
printStack(stack);
/* Get the length of the stack */
/* Get the stack size */
int size = stack.size();
cout << "Stack length size = " << size << endl;
cout << "Stack size = " << size << endl;
/* Check if empty */
/* Check whether it is empty */
bool empty = stack.empty();
cout << "Stack is empty = " << empty << endl;
cout << "Is the stack empty = " << empty << endl;
return 0;
}