题解 | #包含min函数的栈#
包含min函数的栈
https://www.nowcoder.com/practice/4c776177d2c04c2494f2555c9fcc1e49
使用数组模拟栈,栈顶使用rear不断移动,rear初始值为-1
public class Solution { int[] stack = new int[301]; int rear = -1; public void push(int node) { if(rear>=301) return; rear++; stack[rear] = node; } public void pop() { if(rear==-1) return; int n = stack[rear]; rear--; System.out.println(n); } public int top() { return stack[rear]; } public int min() { if(rear==-1) return -10001; int min = stack[0]; for(int i=1;i<=rear;i++){ if(min>stack[i]) min = stack[i]; } return min; } }