Python模拟栈

最新推荐文章于 2024-01-18 15:15:54 发布

「已注销」

最新推荐文章于 2024-01-18 15:15:54 发布

阅读量462

点赞数

分类专栏： Python 文章标签： python 数据结构

本文链接：https://blog.csdn.net/PanDaoxi2020/article/details/120443092

版权

Python 专栏收录该内容

81 篇文章 11 订阅

订阅专栏

# 创建一个栈
stack = []
top,maxSize = 0,100

# 因为Python对列表的要求，需要手动给空白部位添加0，否则会报错
for i in range(maxSize):
    stack.append(0)

# 入栈操作
def push(value):
    global stack,top
    if top < maxSize:
        stack[top] = value
        top += 1

# 出栈操作
def pop():
    global top
    if top > 0:
        top -= 1

# 获取栈顶元素   
def gtop():
    return stack[top]

# 清空栈
def clear():
    global top
    top = 0

# 啥都没干时
print('top:',top)
print('stack:',stack)

# 先入栈
push(1)
push(2)
push(3)
push(4)
print('top:',top)
print('stack:',stack)

# 再出栈
pop()
# 这里的出栈并不是删除列表中的元素，而是将top-1，再次入栈时就会变化
print('top:',top)
print('stack:',stack)

# 获取栈顶
print(gtop())

# 清空栈（直接将top归零）
clear()
print('top:',top)
print('stack:',stack)

top: 0
stack: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
top: 4
stack: [1, 2, 3, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
top: 3
stack: [1, 2, 3, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
4
top: 0
stack: [1, 2, 3, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]