-
Notifications
You must be signed in to change notification settings - Fork 0
/
155. 最小栈.py
43 lines (32 loc) · 943 Bytes
/
155. 最小栈.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
class MinStack:
def __init__(self):
self.stack = []
def push(self, val):
self.stack.append(val)
def pop(self):
self.stack.pop()
def top(self):
return self.stack[-1]
def getMin(self):
return min(self.stack)
# Your MinStack object will be instantiated and called as such:
# obj = MinStack()
# obj.push(val)
# obj.pop()
# param_3 = obj.top()
# param_4 = obj.getMin()
minStack = None
input1 = ["MinStack","push","push","push","getMin","pop","top","getMin"]
input2 = [[],[-2],[0],[-3],[],[],[],[]]
for i in range(len(input1)):
if input1[i] == "MinStack":
minStack = MinStack()
elif input1[i] == "push":
minStack.push(input2[i][0])
elif input1[i] == "getMin":
print(minStack.getMin())
elif input1[i] == "pop":
minStack.pop()
elif input1[i] == "top":
print(minStack.top())
print(input1[i],input2[i], minStack.stack)