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

translation: Add the initial translation of the chapter of stack and queue (#1033)

Browse Source 
* Update the format of Q&As in docs-en

* Fix the code comments of JavaScript and TypeScript

* Add the initial translation of the chapter of stack and queue
This commit is contained in:
Yudong Jin
2024-01-08 19:06:37 +08:00
committed by GitHub
parent c4e4a607e8
commit d3cb600910
37 changed files with 1263 additions and 76 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
docs/chapter_stack_and_queue/deque.md
View File

@@ -209,28 +209,21 @@
// 请注意，由于是数组，unshift() 方法的时间复杂度为 O(n)
deque.unshift(3);
deque.unshift(1);
console.log("双向队列 deque = ", deque);
/* 访问元素 */
const peekFirst = deque[0];
console.log("队首元素 peekFirst = " + peekFirst);
const peekLast = deque[deque.length - 1];
console.log("队尾元素 peekLast = " + peekLast);
/* 元素出队 */
// 请注意，由于是数组，shift() 方法的时间复杂度为 O(n)
const popFront = deque.shift();
console.log("队首出队元素 popFront = " + popFront + "，队首出队后 deque = " + deque);
const popBack = deque.pop();
console.log("队尾出队元素 popBack = " + popBack + "，队尾出队后 deque = " + deque);
/* 获取双向队列的长度 */
const size = deque.length;
console.log("双向队列长度 size = " + size);
/* 判断双向队列是否为空 */
const isEmpty = size === 0;
console.log("双向队列是否为空 = " + isEmpty);
```
=== "TS"
@@ -247,28 +240,21 @@
// 请注意，由于是数组，unshift() 方法的时间复杂度为 O(n)
deque.unshift(3);
deque.unshift(1);
console.log("双向队列 deque = ", deque);
/* 访问元素 */
const peekFirst: number = deque[0];
console.log("队首元素 peekFirst = " + peekFirst);
const peekLast: number = deque[deque.length - 1];
console.log("队尾元素 peekLast = " + peekLast);
/* 元素出队 */
// 请注意，由于是数组，shift() 方法的时间复杂度为 O(n)
const popFront: number = deque.shift() as number;
console.log("队首出队元素 popFront = " + popFront + "，队首出队后 deque = " + deque);
const popBack: number = deque.pop() as number;
console.log("队尾出队元素 popBack = " + popBack + "，队尾出队后 deque = " + deque);
/* 获取双向队列的长度 */
const size: number = deque.length;
console.log("双向队列长度 size = " + size);
/* 判断双向队列是否为空 */
const isEmpty: boolean = size === 0;
console.log("双向队列是否为空 = " + isEmpty);
```
=== "Dart"

4
docs/chapter_stack_and_queue/stack.md
View File

@@ -186,7 +186,7 @@
```javascript title="stack.js"
/* 初始化栈 */
// Javascript 没有内置的栈类，可以把 Array 当作栈来使用
// JavaScript 没有内置的栈类，可以把 Array 当作栈来使用
const stack = [];
/* 元素入栈 */
@@ -213,7 +213,7 @@
```typescript title="stack.ts"
/* 初始化栈 */
// Typescript 没有内置的栈类，可以把 Array 当作栈来使用
// TypeScript 没有内置的栈类，可以把 Array 当作栈来使用
const stack: number[] = [];
/* 元素入栈 */