package stackProblems2;
import java.util.ArrayDeque;
public class MinStack {
ArrayDeque stack = new ArrayDeque<>();
ArrayDeque minStack = new ArrayDeque<>();
void push(int e) {
stack.push(e);
if(minStack.isEmpty()) {
minStack.push(e);
return;
}
if(e <= minStack.peek()) {
minStack.push(e);
}
}
int pop() throws Exception {
if(stack.isEmpty()) throw new Exception("stack is empty");
int ans = stack.pop();
if(ans == minStack.peek()) {
minStack.pop();
}
return ans;
}
int min() throws Exception {
if(stack.isEmpty()) throw new Exception("stack is empty");
return minStack.peek();
}
}