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

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