LeetCode-Solutions/155.min-stack.py at master · Xylphy/LeetCode-Solutions · 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
56
57
58
#
# @lc app=leetcode id=155 lang=python
#
# [155] Min Stack
#

# @lc code=start
import heapq

class MinStack(object):

    def __init__(self):
        self.heap = []
        self.stack = []


    def push(self, val):
        """
        :type val: int
        :rtype: None
        """
        heapq.heappush(self.heap, val)
        self.stack.append(val)


    def pop(self):
        """
        :rtype: None
        """
        if not self.stack:
            return

        self.heap.remove(self.stack.pop())
        heapq.heapify(self.heap)


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


    def getMin(self):
        """
        :rtype: int
        """
        return self.heap[0]


# Your MinStack object will be instantiated and called as such:
# obj = MinStack()
# obj.push(val)
# obj.pop()
# param_3 = obj.top()
# param_4 = obj.getMin()
# @lc code=end