using System;
using System.Collections.Generic;
class Solution
{
List<int> list = new List<int>();
public void push(int node)
{
list.Add(node);
}
public void pop()
{
list.RemoveAt(list.Count -1);
}
public int top()
{
return list[list.Count - 1];
}
public int min()
{
int min = list[0];
for(int i = 0; i < list.Count - 1; i++)
{
if(min > list[i])
min = list[i];
}
return min;
}
}
BM43 包含min函数的栈
于 2023-08-30 10:05:17 首次发布