fuhouyin/hello-algo
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

fix: fix some comment

Browse Source
This commit is contained in:
S-N-O-R-L-A-X 2022-12-23 12:08:15 +08:00
parent 0394f0c547
commit c20f7cdaac
3 changed files with 6 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
codes/javascript/chapter_stack_and_queue/linkedlist_stack.js
View File

@ -1,5 +1,5 @@
/**#stkSize /**#stkSize
* File: linkedlist_queue.js * File: linkedlist_stack.js
* Created Time: 2022-12-22 * Created Time: 2022-12-22
* Author: S-N-O-R-L-A-X (snorlax.xu@outlook.com) * Author: S-N-O-R-L-A-X (snorlax.xu@outlook.com)
*/ */
@ -52,7 +52,7 @@ class LinkedListStack {
return this.#stackPeek.val; return this.#stackPeek.val;
} }
/* 将 List 转化为 Array 并返回 */ /* 将链表转化为 Array 并返回 */
toArray() { toArray() {
let node = this.#stackPeek; let node = this.#stackPeek;
const res = new Array(this.size); const res = new Array(this.size);

4
codes/typescript/chapter_stack_and_queue/linkedlist_stack.ts
View File

@ -1,5 +1,5 @@
/** /**
* File: linkedlist_queue.ts * File: linkedlist_stack.ts
* Created Time: 2022-12-21 * Created Time: 2022-12-21
* Author: S-N-O-R-L-A-X (snorlax.xu@outlook.com) * Author: S-N-O-R-L-A-X (snorlax.xu@outlook.com)
*/ */
@ -52,7 +52,7 @@ class LinkedListStack {
return this.stackPeek.val; return this.stackPeek.val;
} }
/* 将 List 转化为 Array 并返回 */ /* 将链表转化为 Array 并返回 */
toArray(): number[] { toArray(): number[] {
let node = this.stackPeek; let node = this.stackPeek;
const res = new Array<number>(this.size); const res = new Array<number>(this.size);

3
docs/chapter_stack_and_queue/stack.md
View File

@ -396,6 +396,7 @@ comments: true
=== "TypeScript" === "TypeScript"
```typescript title="linkedlist_stack.ts" ```typescript title="linkedlist_stack.ts"
/* 基于链表实现的栈 */
class LinkedListStack { class LinkedListStack {
private stackPeek: ListNode | null; // 将头结点作为栈顶 private stackPeek: ListNode | null; // 将头结点作为栈顶
private stkSize: number = 0; // 栈的长度 private stkSize: number = 0; // 栈的长度
@ -441,7 +442,7 @@ comments: true
return this.stackPeek.val; return this.stackPeek.val;
} }
/* 将 List 转化为 Array 并返回 */ /* 将链表转化为 Array 并返回 */
toArray(): number[] { toArray(): number[] {
let node = this.stackPeek; let node = this.stackPeek;
const res = new Array<number>(this.size); const res = new Array<number>(this.size);