Min Stack Java

最新推荐文章于 2026-06-20 22:09:08 发布

原创最新推荐文章于 2026-06-20 22:09:08 发布 · 918 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#leetcode #Stack

收录于

CareerCup 专栏收录该内容

4 篇文章

订阅专栏

本文介绍了一种利用两个栈实现的最小元素栈设计，其中push、pop和min操作均可在O(1)时间内完成。通过在min栈中始终保持最小元素，该方案有效地解决了最小元素的快速查询问题。

Question: design a stack which, in addition to
push and pop, also has a function min which returns the
minimum element? Push, pop and min should

all operate in O(1) time.

Idea: Use two stacks: stack and minStack
stack: insert data as usual
minStack: always keep minimum element on the top of minStack

class minStack{
    Stack<Integer> stack=new Stack<Integer>();
    Stack<Integer> minStack=new Stack<Integer>();

    public void push(int data){
        stack.add(data);
            if(data<min()){
                minStack.add(data);
            }
    }
    public int pop(){
        int temp=stack.pop();
        if(temp==min()){
            minStack.pop();
        }
        return temp;
    }
    public int min(){
        if(!minStack.isEmpty()) {
            return minStack.peek();
        }else {
            return Integer.MAX_VALUE;
        }
    }
}