Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.
- push(x) -- Push element x onto stack.
- pop() -- Removes the element on top of the stack.
- top() -- Get the top element.
- getMin() -- Retrieve the minimum element in the stack.
Cracking interview 原题,用一个min stack,每次记录当前位置的最小值
class MinStack {
Stack<Integer> stack = new Stack<>();
Stack<Integer> minStack = new Stack<>();
public void push(int x) {
if (minStack.isEmpty() || x <= minStack.peek()) {
minStack.push(x);
}
stack.push(x);
}
public void pop() {
int x = stack.pop();
if (x <= minStack.peek()) {
minStack.pop();
}
}
public int top() {
if (stack.isEmpty()) {
return 0;
}
return stack.peek();
}
public int getMin() {
return minStack.peek();
}
}