leetcode-155 最小栈 Java

最新推荐文章于 2025-12-17 19:02:04 发布

原创最新推荐文章于 2025-12-17 19:02:04 发布 · 312 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#stack #栈 #queue #java

本文详细介绍了一种高效的数据结构——最小栈的两种实现方法。一种是辅助栈和数据栈同步更新，确保每次操作都能快速获取当前栈中最小元素；另一种是不同步更新方式，通过条件判断减少不必要的辅助栈操作，提高效率。这两种方法都在Java环境下进行了实现，适用于需要频繁获取最小值的场景。

https://leetcode-cn.com/problems/min-stack/solution/shi-yong-fu-zhu-zhan-tong-bu-he-bu-tong-bu-python-/

方法一：辅助栈和数据栈同步

import java.util.Stack;
class MinStack {
    private Stack<Integer> data;
    private Stack<Integer> helper;
    /** initialize your data structure here. */
    public MinStack() {
        data = new Stack<>();
        helper = new Stack<>();
    }
    
    public void push(int x) {
        data.add(x);
        if (helper.isEmpty() || helper.peek() >= x) {
            helper.add(x);
        } else {
            helper.add(helper.peek());
        }
    }
    
    public void pop() {
            helper.pop();
            data.pop();
    }
    
    public int top() {
            return data.peek();
    }
    
    public int getMin() {
        return helper.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();
 */

方法二：辅助栈和数据栈不同步

import java.util.Stack;
class MinStack {
    private Stack<Integer> data;
    private Stack<Integer> helper;
    /** initialize your data structure here. */
    public MinStack() {
        data = new Stack<>();
        helper = new Stack<>();
    }
    
    public void push(int x) {
        data.add(x);
        if (helper.isEmpty() || helper.peek() >= x) {
            helper.add(x);
        }
    }
    
    public void pop() {
        // int top = data.pop();
        // if (top == helper.peek()) {
        //     helper.pop();
        // }
        if ((int) helper.peek() == data.peek()) {
            helper.pop();
            data.pop();
        } else {
            data.pop();
        }
    }
    
    public int top() {
        return data.peek();
    }
    
    public int getMin() {
        return helper.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();
 */