1class MyCircularQueue:
2 def __init__(self, k):
3 self.q = [None] * k; self.head = -1; self.tail = -1; self.size = k
4 def enQueue(self, val):
5 if (self.tail + 1) % self.size == self.head: return False
6 if self.head == -1: self.head = 0
7 self.tail = (self.tail + 1) % self.size
8 self.q[self.tail] = val; return True
9 def deQueue(self):
10 if self.head == -1: return False
11 if self.head == self.tail: self.head = -1; self.tail = -1
12 else: self.head = (self.head + 1) % self.size
13 return True