七月day14——栈

T1: 两个栈实现一个队列

class MyQueue {
public:
    stack<int> s1;
    stack<int> s2;
    MyQueue() {

    }
    
    void push(int x) {
       s1.push(x);
    }
    
    int pop() {
       if (s2.empty()) {   //保证s1里先push的先出
           while (!s1.empty()) {
           s2.push(s1.top());
           s1.pop();
           }
       }
       int res = s2.top();
       s2.pop();
       return res;
    }
    
    int peek() {
       int res = this->pop();
       s2.push(res);
       return res;
    }
    
    bool empty() {
       return s1.empty() && s2.empty();
    }
};

/**
 * Your MyQueue object will be instantiated and called as such:
 * MyQueue* obj = new MyQueue();
 * obj->push(x);
 * int param_2 = obj->pop();
 * int param_3 = obj->peek();
 * bool param_4 = obj->empty();
 */

T2：leetcode. 225

class MyStack {
public:
    queue<int> q1;
    queue<int> q2;

    MyStack() {

    }
    
    void push(int x) {
        q1.push(x);
    }
    
    int pop() {
        int size = q1.size();
        size--;
        while (size--) {
            q2.push(q1.front());
            q1.pop();
        }
        int res = q1.front();
        q1.pop();
        q1 = q2;
        while (!q2.empty()) {  // q2清空
            q2.pop();
        }
        return res;
    }
    
    int top() {
       return q1.back();
    }
    
    bool empty() {
       return q1.empty() && q2.empty();
    }
};

/**
 * Your MyStack object will be instantiated and called as such:
 * MyStack* obj = new MyStack();
 * obj->push(x);
 * int param_2 = obj->pop();
 * int param_3 = obj->top();
 * bool param_4 = obj->empty();
 */