-
Notifications
You must be signed in to change notification settings - Fork 3
Expand file tree
/
Copy pathmin.py
More file actions
60 lines (50 loc) · 1.21 KB
/
min.py
File metadata and controls
60 lines (50 loc) · 1.21 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
class MinStack(object):
def __init__(self):
"""
initialize your data structure here.
"""
self.stack = []
# Logic without using min
self.min = float('inf')
def push(self, x):
"""
:type x: int
:rtype: void
"""
self.stack.append(x)
if x < self.min:
self.min = x
def pop(self):
"""
:rtype: void
"""
n = len(self.stack)
element = self.stack[n-1]
if element == self.min:
del self.stack[n-1]
self.min = float('inf')
for item in self.stack:
if item < self.min:
self.min = item
else:
del self.stack[n-1]
return element
def top(self):
"""
:rtype: int
"""
n = len(self.stack)
element = self.stack[n-1]
return element
def getMin(self):
"""
:rtype: int
"""
#return min(self.stack)
return self.min
# 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()