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

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

    def push(self, node):
        # write code here
        self.stack.append(node)
        return 1
    def pop(self):
        # write code here
        return self.stack.pop()
    def top(self):
        # write code here
        return self.stack[-1]
    def min(self):
        # write code here
        return min(self.stack)