Python模拟队列

最新推荐文章于 2024-06-10 22:03:48 发布

「已注销」

最新推荐文章于 2024-06-10 22:03:48 发布

阅读量466

点赞数 2

分类专栏： Python 文章标签： python

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

版权

Python 专栏收录该内容

81 篇文章 11 订阅

订阅专栏

# 创建队列
q = []
maxSize,front,rear = 100,0,0
# 占位
for i in range(maxSize):
    q.append(0)

# 这两个函数我承认我是从我写的C++函数改的
# 进队
def push(value):
    global rear,q
    # 如果队不满则添加值 
    if(rear < maxSize):
        q[rear] = value
        rear += 1

# 出队
def pop():
    global front
    # 如果队首不为队尾（即不为空），则front+1
    if(front != rear):
        front += 1

# 啥也没干
print('q:',q)
print('rear: %d\tfront: %d' % (rear,front))

# 先入队
for i in range(1,6):
    push(i)
print('q:',q)
print('rear: %d\tfront: %d' % (rear,front))

# 再出队
pop()
print('q:',q)
print('rear: %d\tfront: %d' % (rear,front))

q: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
rear: 0	front: 0
q: [1, 2, 3, 4, 5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
rear: 5	front: 0
q: [1, 2, 3, 4, 5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
rear: 5	front: 1