leetcode/Min_Stack at master · ningju94/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
class MinStack:

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


    def push(self, x):
        """
        :type x: int
        :rtype: void
        """
        curMin = self.getMin()
        if curMin == None or x < curMin:
            curMin = x
        self.q.append((x, curMin))


    def pop(self):
        """
        :rtype: void
        """
        self.q.pop()


    def top(self):
        """
        :rtype: int
        """
        if len(self.q) == 0:
            return None
        return self.q[len(self.q)-1][0]


    def getMin(self):
        """
        :rtype: int
        """
        if len(self.q) == 0:
            return None
        return self.q[len(self.q)-1][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()