Min Stack 解答

Question

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.

Solution

Original thinking is to use two stacks, one to store input elements, and the other is to store current min value.

However, there is an improvement that only use one stack.

This stack is to store diff between input value and current min value.

if current value < min value, we set min as current imput value.

Therefore, when we pop or peek each element in stack, we know:

If it's greater than 0, then it must be greater than current min value.

If it's smaller than 0, then it must equal to current min value.

 class MinStack {
     Stack<Long> diff;
     private long min;

     public MinStack() {
         min = Integer.MAX_VALUE;
         diff = new Stack<Long>();
     }
     public void push(int x) {
         diff.push((long)x - min);
         min = x < min? x : min;
     }
     public void pop() {
         if (diff.size() < 1)
             return;
         long tmp = diff.pop();
         if (tmp < 0)
             min -= tmp;
     }
     public int top() {
         long tmp = diff.peek();
         if (tmp < 0)
             tmp = min;
         else
             tmp += min;
         return (int)tmp;
     }
     public int getMin() {
         return (int)min;
     }
 }

注意这里stack和min的类型都应该是long，否则会有越界问题！