class Seque:
def __init__(self,size=100):
self.seque=[0 for _ in range(size)]
self.size=size
self.front = 0
self.rear = 0
def push(self,element):
if not self.is_full():
self.rear=(self.rear+1)%self.size
self.seque[self.rear]=element
else:
raise IndexError("Queue is filled")
def pop(self):
if not self.is_empty():
self.front=(self.front+1)%self.size
return self.seque[self.front]
else:
raise IndexError("queue is empty")
def is_empty(self):
return self.rear==self.front
def is_full(self):
return (self.rear+1)%self.size==self.front
demo2=Seque(6)
for i in range(5):
demo2.push(i)
print(demo2.seque[1:])
python队列内置函数
from collections import deque
q=deque([1,2,3],4)
q.append(1)
q.popleft()
q.appendleft(123)
q.pop()
打印文件末尾的几行
from collections import deque
def tail(n):
with open('test.txt','r') as f:
q=deque(f,n)
return q
for line in tail(3):
print(line,end='')