155. 最小栈

思路：

用list模拟栈，list的append()和pop()函数分别模拟进栈和出栈。

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

    def push(self, x):
        """
        :type x: int
        :rtype: None
        """
        self.stack.append(x)

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

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

    def getMin(self):
        """
        :rtype: int
        """
        return min(self.stack)

155. 最小栈

原文：https://www.cnblogs.com/panweiwei/p/12900167.html