155. Min Stack

题目：

Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.

• push(x) -- Push element x onto stack.
• pop() -- Removes the element on top of the stack.
• top() -- Get the top element.
• getMin() -- Retrieve the minimum element in the stack.

Example:

MinStack minStack = new MinStack();
minStack.push(-2);
minStack.push(0);
minStack.push(-3);
minStack.getMin();   --> Returns -3.
minStack.pop();
minStack.top();      --> Returns 0.
minStack.getMin();   --> Returns -2.

这道题的关键在于可以在常量时间取到最小值，如下是我的解法

class MinStack {

    Stack<Integer> minStack;
    int min;
    /** initialize your data structure here. */
    public MinStack() {
        minStack = new Stack<Integer>();
        min = Integer.MAX_VALUE;
    }
    
    public void push(int x) {
        minStack.push(x);
        if (x < min)
            min = x;
    }
    
    public void pop() {
        if (minStack.size() > 0) {
            int tmp = minStack.pop();
            if (tmp == min)
                if (minStack.search(tmp) == -1) {
                    if (!minStack.isEmpty()) {
                        min = minStack.peek();
                        for (int i : minStack) {
                            if (i < min)
                                min = i;
                        }
                    } else
                        min = Integer.MAX_VALUE;
                }
        }
    }
    
    public int top() {
        return minStack.peek();
    }
    
    public int getMin() {
        return min;
    }
}

 

高票答案，只用了一个stack

public class MinStack {
    long min;
    Stack<Long> stack;

    public MinStack(){
        stack=new Stack<>();
    }
    
    public void push(int x) {
        if (stack.isEmpty()){
            stack.push(0L);
            min=x;
        }else{
            stack.push(x-min);//Could be negative if min value needs to change
            if (x<min) min=x;
        }
    }

    public void pop() {
        if (stack.isEmpty()) return;
        
        long pop=stack.pop();
        
        if (pop<0)  min=min-pop;//If negative, increase the min value
        
    }

    public int top() {
        long top=stack.peek();
        if (top>0){
            return (int)(top+min);
        }else{
           return (int)(min);
        }
    }

    public int getMin() {
        return (int)min;
    }
}