题解 | #【模板】循环队列#

class CircularQueue:
    def __init__(self, capacity ) -> None:
        self.capacity  = capacity
        self.queue = [None for i in range(capacity )]
        self.head = 0
        self.tail = 0
        self.count = 0
    def isEmpty(self):
        return self.count == 0
    def isFull(self):
        return self.count == self.capacity
    def push(self, node):
        if self.isFull():
            return 'full'
        # print(node)
        self.queue[self.tail] = node
        self.count += 1
        # print(':',node, self.count)
        self.tail =  (self.tail + 1) % self.capacity
        return False
    def pop(self):
        if self.isEmpty():
            return 'empty'
        ans = self.queue[self.head]
        self.head =  (self.head + 1) % self.capacity
        self.count -= 1
        return ans
    def front(self):
        if self.isEmpty():
            # print(self.queue)
            return 'empty'
        return self.queue[self.head]


temp = list(map(int, input().split()))
capacity = temp[0]
n = temp[1]

cqueue = CircularQueue(capacity)
for i in range(n):
    opt = input().split()
    if opt[0] == "push":
        temp = cqueue.push(int(opt[1]))
        if temp:
            print(temp)
    elif opt[0] == "pop":
        print(cqueue.pop())
    elif opt[0] == "front":
        print(cqueue.front())