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

20
en/codes/cpp/chapter_stack_and_queue/deque.cpp
View File

@@ -8,10 +8,10 @@
/* Driver Code */
int main() {
/* Initialize double-ended queue */
/* Get the length of the double-ended queue */
deque<int> deque;
/* Element enqueue */
/* Elements enqueue */
deque.push_back(2);
deque.push_back(5);
deque.push_back(4);
@@ -20,27 +20,27 @@ int main() {
cout << "Double-ended queue deque = ";
printDeque(deque);
/* Access element */
/* Update element */
int front = deque.front();
cout << "Front element of the queue front = " << front << endl;
cout << "Front element front = " << front << endl;
int back = deque.back();
cout << "Back element of the queue back = " << back << endl;
cout << "Back element back = " << back << endl;
/* Element dequeue */
deque.pop_front();
cout << "Front element dequeued = " << front << ", after dequeuing from the front";
cout << "Front dequeue element popFront = " << front << ", after front dequeue, deque = ";
printDeque(deque);
deque.pop_back();
cout << "Back element dequeued = " << back << ", after dequeuing from the back";
cout << "Rear dequeue element popLast = " << back << ", after rear dequeue, deque = ";
printDeque(deque);
/* Get the length of the double-ended queue */
int size = deque.size();
cout << "Length of the double-ended queue size = " << size << endl;
cout << "Double-ended queue length size = " << size << endl;
/* Determine if the double-ended queue is empty */
/* Check if the double-ended queue is empty */
bool empty = deque.empty();
cout << "Is the double-ended queue empty = " << empty << endl;
cout << "Double-ended queue is empty = " << empty << endl;
return 0;
}