build

chapter_stack_and_queue/stack.md

@@ -87,7 +87,7 @@ comments: true
     ```python title="stack.py"
     """ 初始化栈 """
     # Python 没有内置的栈类，可以把 List 当作栈来使用 
-    stack = []
+    stack: List[int] = []
     
     """ 元素入栈 """
     stack.append(1)
@@ -97,16 +97,16 @@ comments: true
     stack.append(4)
     
     """ 访问栈顶元素 """
-    peek = stack[-1]
+    peek: int = stack[-1]
     
     """ 元素出栈 """
-    pop = stack.pop()
+    pop: int = stack.pop()
     
     """ 获取栈的长度 """
-    size = len(stack)
+    size: int = len(stack)
     
     """ 判断是否为空 """
-    is_empty = len(stack) == 0
+    is_empty: bool = len(stack) == 0
     ```
 
 === "Go"
@@ -411,40 +411,40 @@ comments: true
         """ 基于链表实现的栈 """
         def __init__(self):
             """ 构造方法 """
-            self.__peek = None
-            self.__size = 0
+            self.__peek: Optional[ListNode] = None
+            self.__size: int = 0
 
-        def size(self):
+        def size(self) -> int:
             """ 获取栈的长度 """
             return self.__size
 
-        def is_empty(self):
+        def is_empty(self) -> bool:
             """ 判断栈是否为空 """
             return not self.__peek
 
-        def push(self, val):
+        def push(self, val: int) -> None:
             """ 入栈 """
             node = ListNode(val)
             node.next = self.__peek
             self.__peek = node
             self.__size += 1
 
-        def pop(self):
+        def pop(self) -> int:
             """ 出栈 """
-            num = self.peek()
+            num: int = self.peek()
             self.__peek = self.__peek.next
             self.__size -= 1
             return num
 
-        def peek(self):
+        def peek(self) -> int:
             """ 访问栈顶元素 """
             # 判空处理
             if not self.__peek: return None
             return self.__peek.val
 
-        def to_list(self):
+        def to_list(self) -> List[int]:
             """ 转化为列表用于打印 """
-            arr = []
+            arr: List[int] = []
             node = self.__peek
             while node:
                 arr.append(node.val)
@@ -951,33 +951,33 @@ comments: true
     ```python title="array_stack.py"
     class ArrayStack:
         """ 基于数组实现的栈 """
-        def __init__(self):
+        def __init__(self) -> None:
             """ 构造方法 """
-            self.__stack = []
+            self.__stack: List[int] = []
 
-        def size(self):
+        def size(self) -> int:
             """ 获取栈的长度 """
             return len(self.__stack)
 
-        def is_empty(self):
+        def is_empty(self) -> bool:
             """ 判断栈是否为空 """
             return self.__stack == []
 
-        def push(self, item):
+        def push(self, item: int) -> None:
             """ 入栈 """
             self.__stack.append(item)
 
-        def pop(self):
+        def pop(self) -> int:
             """ 出栈 """
             assert not self.is_empty(), "栈为空"
             return self.__stack.pop()
 
-        def peek(self):
+        def peek(self) -> int:
             """ 访问栈顶元素 """
             assert not self.is_empty(), "栈为空"
             return self.__stack[-1]
         
-        def to_list(self):
+        def to_list(self) -> List[int]:
             """ 返回列表用于打印 """
             return self.__stack
     ```