-
-
Notifications
You must be signed in to change notification settings - Fork 298
/
Copy path155.py
70 lines (54 loc) · 1.77 KB
/
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
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
__________________________________________________________________________________________________
sample 52 ms submission
class MinStack:
def __init__(self):
"""
initialize your data structure here.
"""
self.stackList= []
self.stackMin = []
def push(self, x: int) -> None:
self.stackList.append(x)
if len(self.stackMin) == 0:
self.stackMin.append(x)
elif x <= self.stackMin[-1]:
self.stackMin.append(x)
def pop(self) -> None:
if self.stackList.pop() == self.stackMin[-1]:
self.stackMin.pop()
def top(self) -> int:
return self.stackList[-1]
def getMin(self) -> int:
return self.stackMin[-1]
# Your MinStack object will be instantiated and called as such:
# obj = MinStack()
# obj.push(x)
# obj.pop()
# param_3 = obj.top()
# param_4 = obj.getMin()
__________________________________________________________________________________________________
sample 16384 kb submission
class MinStack:
def __init__(self):
"""
initialize your data structure here.
"""
self.stack = []
self.min = []
def push(self, x: int) -> None:
self.min.append(x if len(self.stack) == 0 else min(self.min[-1], x))
self.stack.append(x)
def pop(self) -> None:
self.stack.pop()
self.min.pop()
def top(self) -> int:
return self.stack[-1]
def getMin(self) -> int:
return self.min[-1]
# Your MinStack object will be instantiated and called as such:
# obj = MinStack()
# obj.push(x)
# obj.pop()
# param_3 = obj.top()
# param_4 = obj.getMin()
__________________________________________________________________________________________________