循环队列

class MyCircularQueue(object):
    
    def __init__(self, k):
        self.maxsize=k+1
        self.first=0
        self.last=0
        self.list=[None]*(k+1)
    def enQueue(self, value):
        if self.isFull()==False:
            self.list[self.last]=value
            self.last=(self.last+1)%self.maxsize
            return True
        else:
            return False
    def deQueue(self):
        if self.isEmpty()==True:
            return False
        else:
            self.list[self.first]=None
            self.first=(self.first+1)%self.maxsize
            return True
    def Front(self):
        if self.isEmpty()==True:
            return -1
        return self.list[self.first]
    def Rear(self):
        if self.isEmpty()==True:
            return -1
        return self.list[(self.last-1)%self.maxsize]
    def isEmpty(self):
        if self.first==self.last:
            return True
        else:
            return False
    def isFull(self):
        if (self.last+1)%self.maxsize==self.first:
            return True
        else:
            return False


# Your MyCircularQueue object will be instantiated and called as such:
# obj = MyCircularQueue(k)
# param_1 = obj.enQueue(value)
# param_2 = obj.deQueue()
# param_3 = obj.Front()
# param_4 = obj.Rear()
# param_5 = obj.isEmpty()
# param_6 = obj.isFull()