forked from ujjwalkarn/cracking-the-coding-interview
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path3_2_stack_with_minimum.py
59 lines (46 loc) · 1.26 KB
/
3_2_stack_with_minimum.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
#!/usr/bin/env python
"""
Design a stack, which in addition to push and pop, also has a function to
return the minimum element.
"""
class Stack(list):
def push(self, number):
"""Push method -- similar to other languages."""
if len(self) > 0:
last = self[-1]
minimum = self._find_minimum(number, last)
else:
minimum = number
self.minimum = minimum
self.append(NodeWithMin(number, minimum))
def _find_minimum(self, number, last_number):
"""Internal method to compare two numbers."""
if number < last_number.minimum:
return number
return last_number.minimum
def min(self):
"""Return the minimum element."""
return self.minimum
class NodeWithMin(object):
def __init__(self, number, minimum):
self.number = number
self.minimum = minimum
def __repr__(self):
return str(self.number)
def min(self):
return self.minimum
def main():
stack = Stack()
stack.push(1)
stack.push(2)
stack.push(3)
node = stack.pop()
print node.minimum
stack.push(0)
stack.push(4)
node = stack.pop()
print node.min()
print stack.min()
print stack
if __name__ == '__main__':
main()