leetcode/155_min_stack.py at master · sn1572/leetcode · GitHub

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
class MinStack(object):

    def __init__(self):
        """
        initialize your data structure here.
        """
        self.stack = []
        self.minimum = []


    def push(self, x):
        """
        :type x: int
        :rtype: void
        """
        self.stack.append(x)
        try:
            oldMin = self.minimum[-1]
            if x < oldMin:
                self.minimum.append(x)
            else:
                self.minimum.append(oldMin)
        except:
            self.minimum.append(x)


    def pop(self):
        """
        :rtype: void
        """
        self.minimum.pop()
        return(self.stack.pop())


    def top(self):
        """
        :rtype: int
        """
        return(self.stack[-1])


    def getMin(self):
        """
        :rtype: int
        """
        return(self.minimum[-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()