leetcode problem 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 1:

Input
["MinStack","push","push","push","getMin","pop","top","getMin"]
[[],[-2],[0],[-3],[],[],[],[]]

Output
[null,null,null,null,-3,null,0,-2]

Explanation
MinStack minStack = new MinStack();
minStack.push(-2);
minStack.push(0);
minStack.push(-3);
minStack.getMin(); // return -3
minStack.pop();
minStack.top();    // return 0
minStack.getMin(); // return -2

  a(1), a(2),a(3),a(4),a(5),......a(k-1),a(k)   表示第k个数

  f(1), f(2),f(3),f(4),f(5),......f(k-1),f(k) 表示前k个数的最小值

a(k) > f(k-1),  f 不加入 k

f(k) >= a(k)  则 a(k)出栈同时，f(k)出栈 

代码如下：

class MinStack {
public:
    /** initialize your data structure here. */
    stack<int> stk,f;
    MinStack() {
        
    }
    
    void push(int x) {
        if(f.empty() || f.top() >= x) f.push(x);
        stk.push(x);
    }
    
    void pop() {
        if(!stk.empty() && stk.top() <= f.top()) f.pop();
        stk.pop();
    }
    
    int top() {
        return stk.top();
    }
    
    int getMin() {
        return f.top();
    }
};

/**
 * 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();
 */