题解 | 包含min函数的栈

# -*- coding:utf-8 -*-
class Solution:
    def __init__(self):
        self.s = []
    def push(self, node):
        # write code here
        self.s += [node]
    def pop(self):
        # write code here
        return self.s.pop()
    def top(self):
        # write code here
        return self.s[-1]
    def min(self):
        # write code here
        return min(self.s)