leetcode链接:https://leetcode-cn.com/problems/bao-han-minhan-shu-de-zhan-lcof/
定义栈的数据结构,请在该类型中实现一个能够得到栈的最小元素的 min 函数在该栈中,调用 min、push 及 pop 的时间复杂度都是 O(1)。
示例:
MinStack minStack = new MinStack();
minStack.push(-2);
minStack.push(0);
minStack.push(-3);
minStack.min(); --> 返回 -3.
minStack.pop();
minStack.top(); --> 返回 0.
minStack.min(); --> 返回 -2.
解题思路: 定义两个栈,一个用来存储栈中的元素,一个用来存储元素栈当前栈中的最小元素。push方法:当元素push时,判断min栈是否为空或者当前栈顶元素大于新入栈元素,若是,则当前最小元素为新入元素,否则为min栈顶元素,然后将当前最小元素和新入元素分别压入min栈和元素栈中。pop方法:分别pop两个栈。min方法:直接返回min栈顶元素。
class MinStack {
Stack<Integer> stack;
Stack<Integer> minStack;
int minNum;
/** initialize your data structure here. */
public MinStack() {
stack = new Stack<Integer>();
minStack = new Stack<Integer>();
}
public void push(int x) {
stack.add(x);
if(minStack.isEmpty() || x < minStack.peek()){
minNum = x;
}else{
minNum = minStack.peek();
}
minStack.add(minNum);
}
public void pop() {
stack.pop();
minStack.pop();
}
public int top() {
return stack.peek();
}
public int min() {
return minStack.peek();
}
}
/**
* 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.min();
*/