class queue:
def __init__(self, size = 10):
self.queue = []
self.size = size
self.end = -1
def isFull(self):
if self.end == self.size -1:
return True
else:
return False
def isEmpty(self):
if self.end == -1:
return True
else:
return False
def setsize(self, size):
self.size = size
def getsize(self):
return self.end + 1
def End(self):
return self.end
def In(self, value):
if self.isFull():
raise "queue is full"
else:
self.queue.append(value)
self.end += 1
def Out(self):
if self.isEmpty():
raise "queue is empty"
else:
data = self.queue[0]
self.queue = self.queue[1:]
self.end -= 1
return data
if __name__ == '__main__':
q = queue()
for i in range(1,15):
try:
q.In(i)
except:
print "out of queue"
else:
print("insert %d is ok" % q.queue[q.End()])
print "output all value in queue"
for i in q.queue:
print("%d " % i)
while not q.isEmpty():
ret = q.Out()
print("out %d from queue" % ret)
python题目-----queue by list
最新推荐文章于 2023-08-01 16:46:02 发布