leetcode155最小栈

155. 最小栈

问题

设计一个支持 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.

思路

两个栈，一个最小值栈，一个普通栈，每次插入一个数前，比较该数是否比最小值栈的栈顶小，若小则push该值，若大于则再次push栈顶的值

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

优化

发现最小栈中不必消耗那么多的空间

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