build

chapter_stack_and_queue/stack.md

@@ -513,23 +513,23 @@ comments: true
     ```javascript title="linkedlist_stack.js"
     /* 基于链表实现的栈 */
     class LinkedListStack {
-        #stackPeek;  // 将头结点作为栈顶
+        #stackPeek;     // 将头结点作为栈顶
         #stkSize = 0;   // 栈的长度
-    
+
         constructor() {
             this.#stackPeek = null;
         }
-    
+
         /* 获取栈的长度 */
         get size() {
             return this.#stkSize;
         }
-    
+
         /* 判断栈是否为空 */
         isEmpty() {
             return this.size == 0;
         }
-    
+
         /* 入栈 */
         push(num) {
             const node = new ListNode(num);
@@ -537,26 +537,22 @@ comments: true
             this.#stackPeek = node;
             this.#stkSize++;
         }
-    
+
         /* 出栈 */
         pop() {
             const num = this.peek();
-            if (!this.#stackPeek) {
-                throw new Error("栈为空！");
-            }
             this.#stackPeek = this.#stackPeek.next;
             this.#stkSize--;
             return num;
         }
-    
+
         /* 访问栈顶元素 */
         peek() {
-            if (!this.#stackPeek) {
-                throw new Error("栈为空！");
-            }
+            if (!this.#stackPeek)
+                throw new Error("栈为空");
             return this.#stackPeek.val;
         }
-    
+
         /* 将链表转化为 Array 并返回 */
         toArray() {
             let node = this.#stackPeek;
@@ -576,22 +572,22 @@ comments: true
     /* 基于链表实现的栈 */
     class LinkedListStack {
         private stackPeek: ListNode | null;  // 将头结点作为栈顶
-        private stkSize: number = 0;   // 栈的长度
-    
+        private stkSize: number = 0;         // 栈的长度
+
         constructor() {
             this.stackPeek = null;
         }
-    
+
         /* 获取栈的长度 */
         get size(): number {
             return this.stkSize;
         }
-    
+
         /* 判断栈是否为空 */
         isEmpty(): boolean {
             return this.size == 0;
         }
-    
+
         /* 入栈 */
         push(num: number): void {
             const node = new ListNode(num);
@@ -599,26 +595,24 @@ comments: true
             this.stackPeek = node;
             this.stkSize++;
         }
-    
+
         /* 出栈 */
         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;
         }
-    
+
         /* 访问栈顶元素 */
         peek(): number {
-            if (!this.stackPeek) {
-                throw new Error("栈为空！");
-            }
+            if (!this.stackPeek)
+                throw new Error("栈为空");
             return this.stackPeek.val;
         }
-    
+
         /* 将链表转化为 Array 并返回 */
         toArray(): number[] {
             let node = this.stackPeek;
@@ -941,30 +935,40 @@ comments: true
         constructor() {
             this.stack = [];
         }
+        
         /* 获取栈的长度 */
         get size() {
             return this.stack.length;
         }
+
         /* 判断栈是否为空 */
         empty() {
             return this.stack.length === 0;
         }
+
         /* 入栈 */
         push(num) {
             this.stack.push(num);
         }
+
         /* 出栈 */
         pop() {
             if (this.empty())
                 throw new Error("栈为空");
             return this.stack.pop();
         }
+
         /* 访问栈顶元素 */
         top() {
             if (this.empty())
                 throw new Error("栈为空");
             return this.stack[this.stack.length - 1];
         }
+
+        /* 返回 Array */
+        toArray() {
+            return this.stack;
+        }
     };
     ```
 
@@ -977,30 +981,40 @@ comments: true
         constructor() {
             this.stack = [];
         }
+
         /* 获取栈的长度 */
         get size(): number {
             return this.stack.length;
         }
+
         /* 判断栈是否为空 */
         empty(): boolean {
             return this.stack.length === 0;
         }
+
         /* 入栈 */
         push(num: number): void {
             this.stack.push(num);
         }
+
         /* 出栈 */
         pop(): number | undefined {
             if (this.empty())
                 throw new Error('栈为空');
             return this.stack.pop();
         }
+
         /* 访问栈顶元素 */
         top(): number | undefined {
             if (this.empty())
                 throw new Error('栈为空');
             return this.stack[this.stack.length - 1];
         }
+
+        /* 返回 Array */
+        toArray() {
+            return this.stack;
+        }
     };
     ```