题目链接:https://leetcode-cn.com/problems/min-stack/description/
设计一个支持 push,pop,top 操作,并能在常数时间内检索到最小元素的栈。
-
push(x) -- 将元素 x 推入栈中。 pop() -- 删除栈顶的元素。 top() -- 获取栈顶元素。 getMin() -- 检索栈中的最小元素。 示例: MinStack minStack = new MinStack(); minStack.push(-2); minStack.push(0); minStack.push(-3); minStack.getMin(); --> 返回 -3. minStack.pop(); minStack.top(); --> 返回 0. minStack.getMin(); --> 返回 -2.
思路:维持两个栈 一个是元素压入栈 一个做最小元素压入栈 只要比栈顶元素小或者等于就压入
class MinStack { /** initialize your data structure here. */ private Stack<Integer> pStack; private Stack<Integer> mStack; public MinStack() { pStack=new Stack<>(); mStack=new Stack<>(); } public void push(int x) { pStack.push(x); if(mStack.isEmpty()||mStack.peek()>=x){ mStack.push(x); } } public void pop() { int x=pStack.pop(); if(x==mStack.peek()) mStack.pop(); } public int top() { return pStack.peek(); } public int getMin() { return mStack.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.getMin(); */