155. 最小栈

class MinStack(object):

    def __init__(self):
        """
        initialize your data structure here.
        """
        self.stack = []
        self.min_val = []   # 辅助栈


    def push(self, val):
        """
        :type val: int
        :rtype: None
        """
        if not self.min_val or self.min_val[-1] >= val:
            self.min_val.append(val)
        else:
            self.min_val.append(self.min_val[-1])
        self.stack.append(val)


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


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

    def getMin(self):
        """
        :rtype: int
        """
        return self.min_val[-1]



# 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()