-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathstackToQueue.py
More file actions
46 lines (40 loc) · 985 Bytes
/
Copy pathstackToQueue.py
File metadata and controls
46 lines (40 loc) · 985 Bytes
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
class MyQueue:
def __init__(self):
"""
Initialize your data structure here.
"""
self.queue = []
def push(self, x: int) -> None:
"""
Push element x to the back of queue.
"""
self.queue.insert(0,x)
def pop(self) -> int:
"""
Removes the element from in front of queue and returns that element.
"""
x = self.queue[-1]
self.queue.pop()
return x
def peek(self) -> int:
"""
Get the front element.
"""
if self.queue == []:
return None
else :
return self.queue[-1]
def empty(self) -> bool:
"""
Returns whether the queue is empty.
"""
if len(self.queue) == 0:
return True
else :
return False
if __name__ == "__main__":
obj = MyQueue()
obj.push(2)
param_2 = obj.pop()
param_3 = obj.peek()
param_4 = obj.empty()