algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-04 06:07:20 +08:00
Code Issues Packages Projects Releases Wiki Activity

fine tune

Browse Source
This commit is contained in:
Yudong Jin
2022-12-24 12:53:16 +08:00
parent 49fe239cfa
commit 17909162fc
2 changed files with 7 additions and 13 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -8,7 +8,7 @@ const ListNode = require("../include/ListNode");
/* 基于链表实现的栈 */ /* 基于链表实现的栈 */
class LinkedListStack { class LinkedListStack {
#stackPeek; // 将头结点作为栈顶 #stackPeek; // 将头结点作为栈顶
#stkSize = 0; // 栈的长度 #stkSize = 0; // 栈的长度
constructor() { constructor() {
@ -36,9 +36,6 @@ class LinkedListStack {
/* 出栈 */ /* 出栈 */
pop() { pop() {
const num = this.peek(); const num = this.peek();
if (!this.#stackPeek) {
throw new Error("栈为空！");
}
this.#stackPeek = this.#stackPeek.next; this.#stackPeek = this.#stackPeek.next;
this.#stkSize--; this.#stkSize--;
return num; return num;
@ -46,9 +43,8 @@ class LinkedListStack {
/* 访问栈顶元素 */ /* 访问栈顶元素 */
peek() { peek() {
if (!this.#stackPeek) { if (!this.#stackPeek)
throw new Error("栈为空！"); throw new Error("栈为空！");
}
return this.#stackPeek.val; return this.#stackPeek.val;
} }

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

@ -9,7 +9,7 @@ import ListNode from "../module/ListNode"
/* 基于链表实现的栈 */ /* 基于链表实现的栈 */
class LinkedListStack { class LinkedListStack {
private stackPeek: ListNode | null; // 将头结点作为栈顶 private stackPeek: ListNode | null; // 将头结点作为栈顶
private stkSize: number = 0; // 栈的长度 private stkSize: number = 0; // 栈的长度
constructor() { constructor() {
this.stackPeek = null; this.stackPeek = null;
@ -36,9 +36,8 @@ class LinkedListStack {
/* 出栈 */ /* 出栈 */
pop(): number { pop(): number {
const num = this.peek(); const num = this.peek();
if (!this.stackPeek) { if (!this.stackPeek)
throw new Error("栈为空！"); throw new Error("栈为空");
}
this.stackPeek = this.stackPeek.next; this.stackPeek = this.stackPeek.next;
this.stkSize--; this.stkSize--;
return num; return num;
@ -46,9 +45,8 @@ class LinkedListStack {
/* 访问栈顶元素 */ /* 访问栈顶元素 */
peek(): number { peek(): number {
if (!this.stackPeek) { if (!this.stackPeek)
throw new Error("栈为空！"); throw new Error("栈为空");
}
return this.stackPeek.val; return this.stackPeek.val;
} }