hello-algo/codes/python/chapter_stack_and_queue/stack.py
Yudong Jin 8918ec9079
refactor: Follow the PEP 585 Typing standard (#439)
* Follow the PEP 585 Typing standard

* Update list.py
2023-03-23 18:51:56 +08:00

36 lines
849 B
Python

"""
File: stack.py
Created Time: 2022-11-29
Author: Peng Chen (pengchzn@gmail.com)
"""
""" Driver Code """
if __name__ == "__main__":
""" 初始化栈 """
# Python 没有内置的栈类,可以把 list 当作栈来使用
stack: list[int] = []
""" 元素入栈 """
stack.append(1)
stack.append(3)
stack.append(2)
stack.append(5)
stack.append(4)
print("栈 stack =", stack)
""" 访问栈顶元素 """
peek: int = stack[-1]
print("栈顶元素 peek =", peek)
""" 元素出栈 """
pop: int = stack.pop()
print("出栈元素 pop =", pop)
print("出栈后 stack =", stack)
""" 获取栈的长度 """
size: int = len(stack)
print("栈的长度 size =", size)
""" 判断是否为空 """
is_empty: bool = len(stack) == 0
print("栈是否为空 =", is_empty)