-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path232_Implement_Queue_using_Stacks.py
More file actions
55 lines (47 loc) · 1.18 KB
/
232_Implement_Queue_using_Stacks.py
File metadata and controls
55 lines (47 loc) · 1.18 KB
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
"""
MyQueue queue = new MyQueue();
queue.push(1);
queue.push(2);
queue.peek(); // returns 1
queue.pop(); // returns 1
queue.empty(); // returns false
"""
class MyQueue:
def __init__(self):
"""
Initialize your data structure here.
"""
self.inStack = []
self.outStack = []
def adust(self):
while self.inStack:
self.outStack.append(self.inStack.pop())
def push(self, x: int) -> None:
"""
Push element x to the back of queue.
"""
self.inStack.append(x)
def pop(self) -> int:
"""
Removes the element from in front of queue and returns that element.
"""
self.adust()
return self.outStack.pop()
def peek(self) -> int:
"""
Get the front element.
"""
self.adust()
return self.outStack[-1]
def empty(self) -> bool:
"""
Returns whether the queue is empty.
"""
self.adust()
return not self.outStack
# Your MyQueue object will be instantiated and called as such:
# obj = MyQueue()
# obj.push(x)
# param_2 = obj.pop()
# param_3 = obj.peek()
# param_4 = obj.empty()