-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmin_stack.py
More file actions
69 lines (59 loc) · 1.37 KB
/
min_stack.py
File metadata and controls
69 lines (59 loc) · 1.37 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
61
62
63
64
65
66
67
68
69
# 155. Min Stack
# https://leetcode.com/problems/min-stack
import unittest
class MinStack:
def __init__(self):
"""
initialize your data structure here.
"""
self.stack = []
self.min = float('inf')
def push(self, x):
"""
:type x: int
:rtype: void
"""
self.stack.append(x)
if self.min > x:
self.min = x
def pop(self):
"""
:rtype: void
"""
if self.min == self.stack.pop():
self.min = float('inf')
for i in self.stack:
if self.min > i:
self.min = i
def top(self):
"""
:rtype: int
"""
return self.stack[-1]
def getMin(self):
"""
:rtype: int
"""
return self.min
class TestNumOfIsland(unittest.TestCase):
def test(self):
# Your MinStack object will be instantiated and called as such:
min_stack = MinStack()
min_stack.push(-2)
min_stack.push(0)
min_stack.push(-3)
self.assertEqual(
min_stack.getMin(),
-3
)
min_stack.pop()
self.assertEqual(
min_stack.top(),
0
)
self.assertEqual(
min_stack.getMin(),
-2
)
if __name__ == '__main__':
unittest.TestCase()