mirror of
https://github.com/krahets/hello-algo.git
synced 2025-12-19 07:17:54 +08:00
fine tune
This commit is contained in:
@@ -9,7 +9,7 @@ import ListNode from "../module/ListNode"
|
||||
/* 基于链表实现的栈 */
|
||||
class LinkedListStack {
|
||||
private stackPeek: ListNode | null; // 将头结点作为栈顶
|
||||
private stkSize: number = 0; // 栈的长度
|
||||
private stkSize: number = 0; // 栈的长度
|
||||
|
||||
constructor() {
|
||||
this.stackPeek = null;
|
||||
@@ -36,9 +36,8 @@ class LinkedListStack {
|
||||
/* 出栈 */
|
||||
pop(): number {
|
||||
const num = this.peek();
|
||||
if (!this.stackPeek) {
|
||||
throw new Error("栈为空!");
|
||||
}
|
||||
if (!this.stackPeek)
|
||||
throw new Error("栈为空");
|
||||
this.stackPeek = this.stackPeek.next;
|
||||
this.stkSize--;
|
||||
return num;
|
||||
@@ -46,9 +45,8 @@ class LinkedListStack {
|
||||
|
||||
/* 访问栈顶元素 */
|
||||
peek(): number {
|
||||
if (!this.stackPeek) {
|
||||
throw new Error("栈为空!");
|
||||
}
|
||||
if (!this.stackPeek)
|
||||
throw new Error("栈为空");
|
||||
return this.stackPeek.val;
|
||||
}
|
||||
|
||||
|
||||
Reference in New Issue
Block a user