题解 | #用两个栈实现队列#

基于c++实现：

官方给的：

class Solution
{
public:
    void push(int node) {
        stack1.push(node);
    }

    int pop() {
        int temp;
        if(!stack2.empty()){
            temp = stack2.top();
            stack2.pop();
        }else{
            while(!stack1.empty()){
            stack2.push(stack1.top());
            stack1.pop();
            }
            temp = stack2.top(); 
            stack2.pop();
        }
        return temp;
    }

private:
    stack<int> stack1;
    stack<int> stack2;
};

自己写的，还是差一点呦！

class Solution
{
public:
    void push(int node) {
        while(!stack2.empty()){
            stack1.push(stack2.top());
            stack2.pop();
            }
        stack1.push(node);
    }

    int pop() {
        int temp;
        while(!stack1.empty()){
            stack2.push(stack1.top());
            stack1.pop();
            }
        temp = stack2.top();
        stack2.pop();
        return temp;
    }

private:
    stack<int> stack1;
    stack<int> stack2;
};