题解 | #包含min函数的栈#

# -*- coding:utf-8 -*-
class Solution:
    def __init__(self):
        self.stack = []
        self.min_stack = []

    def push(self, node):
        self.stack.append(node)
        if len(self.min_stack) == 0:
            self.min_stack.append(node)
        elif self.min_stack[-1] > node:
            self.min_stack.append(node)
        else: #重复加入栈顶
            self.min_stack.append(self.min_stack[-1])


    def pop(self):
        self.stack.pop()
        self.min_stack.pop()

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

    def min(self):
        return self.min_stack[-1]