基于普通的队列形式,增加队列长度的判断

class Cirque():
    def __init__(self):
        self.items = []
    
    def push(self, x):
        return self.items.append(x)
    
    def front(self):
        return self.items[0]
        
    def pop(self):
        return self.items.pop(0)
        
    def size(self):
        return len(self.items)

message = input() # 输入行信息
messagesplt = message.split()
n = int(messagesplt[0]) # 循环列表长度
q = int(messagesplt[1]) # 操作次数
s = Cirque()
for i in range(q):
    opo = input()
    oposplt = opo.split(" ")
    if oposplt[0] == 'push':
        if s.size() == n:
            print('full')
        else:
            s.push(oposplt[1])
    elif oposplt[0] == 'front':
        if s.size() == 0:
            print('empty')
        else:
            print(s.front())
    elif oposplt[0] == 'pop':
        if s.size() == 0:
            print('empty')
        else:
            print(s.pop())
    else:
        raise ValueError("无此操作")