-
Notifications
You must be signed in to change notification settings - Fork 0
/
622_my_circular_queue.py
80 lines (71 loc) · 2.01 KB
/
622_my_circular_queue.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
class MyCircularQueue(object):
def __init__(self, k):
"""
Initialize your data structure here. Set the size of the queue to be k.
:type k: int
"""
self._len = k
self._elems = [0] * self._len
self._head = 0
self._num = 0
def enQueue(self, value):
"""
Insert an element into the circular queue. Return true if the operation is successful.
:type value: int
:rtype: bool
"""
# if self._num == self._len:
if self.isFull():
return False
else:
self._elems[(self._head+self._num) % self._len] = value
self._num += 1
return True
def deQueue(self):
"""
Delete an element from the circular queue. Return true if the operation is successful.
:rtype: bool
"""
# if self._num == 0:
if self.isEmpty():
return False
else:
self._head = (self._head+1) % self._len
self._num -= 1
return True
def Front(self):
"""
Get the front item from the queue.
:rtype: int
"""
if self._num == 0:
return -1
return self._elems[self._head]
def Rear(self):
"""
Get the last item from the queue.
:rtype: int
"""
if self._num == 0:
return -1
return self._elems[(self._head+self._num-1) % self._len]
def isEmpty(self):
"""
Checks whether the circular queue is empty or not.
:rtype: bool
"""
return self._num == 0
def isFull(self):
"""
Checks whether the circular queue is full or not.
:rtype: bool
"""
return self._num == self._len
# 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()