栈的python代码

codes/python/chapter_stack_and_queue/stack.py

@@ -4,7 +4,36 @@ Created Time: 2022-11-25
 Author: Krahets (krahets@163.com)
 '''
 
-import sys, os.path as osp
+import os.path as osp
+import sys
+
 sys.path.append(osp.dirname(osp.dirname(osp.abspath(__file__))))
 from include import *
 
+if __name__ == "__main__":
+    """ 初始化栈 """
+    stack = []
+
+    """ 元素入栈 """
+    stack.append(1)
+    stack.append(3)
+    stack.append(2)
+    stack.append(5)
+    stack.append(4)
+    print("栈 stack = ", stack)
+
+    """ 访问栈顶元素 """
+    peek = stack[-1]
+    print("栈顶元素 peek = ", peek)
+
+    """ 元素出栈 """
+    pop = stack.pop()
+    print("出栈元素 pop = ", pop)
+    print("出栈后 stack = ", stack)
+
+    """ 获取栈的长度 """
+    size = len(stack)
+    print("栈的长度 size = ", size)
+
+    """ 判断是否为空 """
+    isEmpty = (stack == [])