Python模拟队列

原创

PanDaoxi 2022-03-01 17:08:51 博主文章分类：Python ©著作权

文章标签 python 出队 c++函数 文章分类 Python 后端开发

©著作权归作者所有：来自51CTO博客作者PanDaoxi的原创作品，请联系作者获取转载授权，否则将追究法律责任

# 创建队列
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