代码随想录算法训练营33期 第十天| 232.用栈实现队列、225. 用队列实现栈

232.用栈实现队列

class MyQueue {
public:
    stack<int> stIn;
    stack<int> stOut;
    MyQueue() {
        
    }
    
    void push(int x) {
        stIn.push(x);
    }
    
    int pop() {
        if (stOut.empty()){
            while(!stIn.empty()){
                stOut.push(stIn.top());
                stIn.pop(); //pop()无返回值
            }
        }
        int temp = stOut.top();
        stOut.pop();
        return temp;
    }
    
    int peek() {
        int temp = this->pop();
        stOut.push(temp);
        return temp;
    }
    
    bool empty() {
        if (stIn.empty()&&stOut.empty())
            return true;
        return false;
    }
};

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

225. 用队列实现栈

class MyStack {
public:
    queue<int> que1;
    queue<int> que2; //备份队列

    MyStack() {
        
    }
    
    void push(int x) {
        que1.push(x);
    }
    
    int pop() {
        int temp;
        
        /*for (int i=0; i<que1.size()-1; i++){
            que2.push(que1.front());
            que1.pop();
        }
        temp = que1.front();
        que1.pop();
        que1 = que2;
        while (!que2.empty()){
            que2.pop();
        }
        return temp;*/
        int size = que1.size()-1;
        while (size--){
            que2.push(que1.front());
            que1.pop();
        }
        temp = que1.front();
        que1.pop();
        que1 = que2;
        while (!que2.empty()){
            que2.pop();
        }
        return temp;
    }
    
    int top() {
        return que1.back();
    }
    
    bool empty() {
        return que1.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();
 */

注意：pop()时如果使用for循环配合que1.size()的方式控制循环次数会出错，因为每次que1.pop之后，que1.size()的长度都会减少。