summary:
consider each node in the stack having a minmium value
package myapp.kit.leetcode.top100liked;
import java.util.ArrayList;
import java.util.List;
/**
* 155
* easy
* https://leetcode.com/problems/min-stack/
*
* 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.
*
*
* Example 1:
*
* Input
* ["MinStack","push","push","push","getMin","pop","top","getMin"]
* [[],[-2],[0],[-3],[],[],[],[]]
*
* Output
* [null,null,null,null,-3,null,0,-2]
*
* Explanation
* MinStack minStack = new MinStack();
* minStack.push(-2);
* minStack.push(0);
* minStack.push(-3);
* minStack.getMin(); // return -3
* minStack.pop();
* minStack.top(); // return 0
* minStack.getMin(); // return -2
*
*
* Constraints:
*
* Methods pop, top and getMin operations will always be called on non-empty stacks.
*
* @author huangdingsheng
* @version 1.0, 2020/5/6
*/
public class MinStack {
private int min = Integer.MAX_VALUE;
private List<Integer> list = new ArrayList<>();
/** initialize your data structure here. */
public MinStack() {
}
public void push(int x) {
if (x < min) {
min = x;
}
list.add(x);
list.add(min);
}
public void pop() {
list.remove(list.size() - 1);
list.remove(list.size() - 1);
if (list.size() > 0) {
min = list.get(list.size() - 1);
} else {
min = Integer.MAX_VALUE;
}
}
public int top() {
return list.get(list.size() - 2);
}
public int getMin() {
return min;
}
/**
* Your MinStack object will be instantiated and called as such:
* MinStack obj = new MinStack();
* obj.push(x);
* obj.pop();
* int param_3 = obj.top();
* int param_4 = obj.getMin();
*/
}