剑指 Offer 09. 用两个栈实现队列 & 剑指 Offer 30. 包含min函数的栈

力扣（LeetCode）官网 - 全球极客挚爱的技术成长平台

class CQueue {
public:
    CQueue() {

    }
    stack<int> s1,s2;
    void appendTail(int value) {
        s1.push(value);
    }
    
    int deleteHead() {
        if(!s2.empty()){
            int val =s2.top();s2.pop();
            return val;
        }
        while(!s1.empty())
        {
            s2.push(s1.top());s1.pop();
        }

        if(s2.empty()) return -1;
        int val = s2.top();s2.pop();
        return val;
    }
};

/**
 * Your CQueue object will be instantiated and called as such:
 * CQueue* obj = new CQueue();
 * obj->appendTail(value);
 * int param_2 = obj->deleteHead();
 */

力扣（LeetCode）官网 - 全球极客挚爱的技术成长平台

class MinStack {
public:
    /** initialize your data structure here. */
    stack<int> s,min_s;
    MinStack() {
        min_s.push(INT_MAX);
    }
    
    void push(int x) {
        s.push(x);
        min_s.push(std::min(x,min_s.top()));
    }
    
    void pop() {
        s.pop();
        min_s.pop();
    }
    
    int top() {
        return s.top();
    }
    
    int min() {
        return min_s.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->min();
 */