-
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
90 lines (72 loc) · 2.13 KB
/
Copy path232-Implement-Queue-using-Stacks.py
File metadata and controls
90 lines (72 loc) · 2.13 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
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
81
82
83
84
85
86
87
88
89
90
# region EfficientPushAmortizedPop
class MyQueue:
def __init__(self):
self.main = list()
self.holding = list()
self.front = int
# Time O(1)
# Space O(n) Need space for each elem
def push(self, x: int) -> None:
if not self.main:
self.front = x
self.main.append(x)
# Time O(1) Amortized
# Space O(1)
def pop(self) -> int:
# Moving elements to the holding stack reverses the order s.t. the top holding stack elem
# will be the first "queue" elem. Only should move elems to holding stack once empty
# to maintain order
if not self.holding:
while self.main:
self.holding.append(self.main.pop())
return self.holding.pop()
# Time O(1)
# Space O(1)
def peek(self) -> int:
if self.holding:
return self.holding[len(self.holding) - 1]
return self.front
# Time O(1)
# Space O(1)
def empty(self) -> bool:
return not self.main and not self.holding
# 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()
# endregion
# region LessEfficientPush
class MyQueue:
def __init__(self):
self.main = list()
self.holding = list()
# Time O(n) Each elem is pushed and popped twice except for new one
# Space O(n) Need space for each elem
def push(self, x: int) -> None:
while self.main:
self.holding.append(self.main.pop())
self.main.append(x)
while self.holding:
self.main.append(self.holding.pop())
# Time O(1)
# Space O(1)
def pop(self) -> int:
return self.main.pop()
# Time O(1)
# Space O(1)
def peek(self) -> int:
if self.main:
return self.main[len(self.main) - 1]
# Time O(1)
# Space O(1)
def empty(self) -> bool:
return not self.main
# 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()
# endregion