class SqQueue():
def __init__(self, maxSize):
self.maxSize = maxSize
self.queueSlem = [None] * self.maxSize
self.front = 0
self.rear = 0
def clear(self):
self.front = 0
self.rear = 0
def isEmpty(self):
return self.rear == self.front
def offer(self, x):
if self.rear == self.maxSize:
raise Exception("已满")
self.queueSlem[self.rear] = x
self.rear += 1
def poll(self):
if self.isEmpty():
return None
p = self.queueSlem[self.front]
self.front += 1
return p
l = SqQueue(5)
l.offer(3)
l.offer(5)
print(l.queueSlem)
print(l.poll())
print(l.poll())
[3, 5, None, None, None]
3
5
版权声明:本文内容由互联网用户自发贡献,该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容, 请发送邮件至 dio@foxmail.com 举报,一经查实,本站将立刻删除。