-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathMyStack.py
38 lines (27 loc) · 827 Bytes
/
MyStack.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
from collections import deque
class MyStack:
def __init__(self):
self.left = deque()
self.right = deque()
def push(self, x: int) -> None:
self.right.append(x)
while self.left:
self.right.append(self.left.popleft())
self.left, self.right = self.right, self.left
def pop(self) -> int:
return self.left.popleft()
def top(self) -> int:
return self.left[0]
def empty(self) -> bool:
return not self.left
def test1():
myStack = MyStack()
myStack.push(1)
myStack.push(2)
assert(myStack.top() == 2) # 返回 2
assert(myStack.pop() == 2) # 返回 2
assert(myStack.empty() == False) # 返回 False
assert(myStack.pop() == 1)
assert(myStack.empty() == True)
if __name__ == "__main__":
test1()