leetcode：13.最小栈简单

最新推荐文章于 2024-11-13 11:37:20 发布

风游明

最新推荐文章于 2024-11-13 11:37:20 发布

阅读量137

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/qq_33548675/article/details/121648606

版权

leetcode java leetcode

leetcode 专栏收录该内容

26 篇文章 0 订阅

订阅专栏

class MinStack {

    private Stack<Integer> data;
    private Stack<Integer> minStack;

    /** initialize your data structure here. */
    public MinStack() {
        data = new Stack();
        minStack = new Stack();
    }

    public void push(int x) {
        data.push(x);
        if(minStack.isEmpty()|| minStack.peek() >= x){
            minStack.push(x);
        }

    }

    public void pop() {
        int x = data.pop();
        if(!minStack.isEmpty() && minStack.peek().equals(x)){
            minStack.pop();
        }
    }

    public int top() {
       return data.peek();
    }

    public int getMin() {
        return minStack.peek();
    }

}