-
-
Notifications
You must be signed in to change notification settings - Fork 300
/
232.py
88 lines (73 loc) · 2.04 KB
/
232.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
81
82
83
84
85
86
87
88
__________________________________________________________________________________________________
sample 24 ms submission
class MyQueue:
def __init__(self):
"""
Initialize your data structure here.
"""
self.q = []
def push(self, x: int) -> None:
"""
Push element x to the back of queue.
"""
self.q.append(x)
def pop(self) -> int:
"""
Removes the element from in front of queue and returns
"""
f = self.q[0]
del self.q[0]
return f
def peek(self) -> int:
"""
Get the front element.
"""
return self.q[0]
def empty(self) -> bool:
"""
Returns whether the queue is empty.
"""
return len(self.q) == 0
# 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()
__________________________________________________________________________________________________
sample 12944 kb submission
class MyQueue:
def __init__(self):
"""
Initialize your data structure here.
"""
self.stack=[]
def push(self, x: int) -> None:
"""
Push element x to the back of queue.
"""
self.stack.append(x)
def pop(self) -> int:
"""
Removes the element from in front of queue and returns that element.
"""
return self.stack.pop(0)
def peek(self) -> int:
"""
Get the front element.
"""
return self.stack[0]
def empty(self) -> bool:
"""
Returns whether the queue is empty.
"""
if not self.stack:
return True
return False
# 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()
__________________________________________________________________________________________________