剑指 Offer 30. 包含min函数的栈

https://leetcode-cn.com/problems/bao-han-minhan-shu-de-zhan-lcof/
定义栈的数据结构，请在该类型中实现一个能够得到栈的最小元素的 min 函数在该栈中，调用 min、push 及 pop 的时间复杂度都是 O(1)。

思路：使用辅助栈，存储当前元素入栈后栈中最小元素。若当前元素入栈后，栈中最小元素发生改变或当前入栈元素等于栈中最小元素，则当前元素入辅助栈。这样可以保证辅助栈的栈顶永远是当前栈中最小元素。如果元素出栈，判断元素和辅助栈栈顶相同，则栈中当前最小元素出栈，辅助栈栈顶同步出栈。具体过程如下图：

class MinStack(object):

    def __init__(self):
        """
        initialize your data structure here.
        """
        self.result = list()
        self.fuzhu = list()


    def push(self, x):
        """
        :type x: int
        :rtype: None
        """
        self.result.append(x)
        if len(self.fuzhu) == 0 or x <= self.fuzhu[-1]:
            self.fuzhu.append(x)
        return


    def pop(self):
        """
        :rtype: None
        """
        tmp = self.result.pop()
        if self.fuzhu[-1] == tmp:
            self.fuzhu.pop()
        return


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


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