牛客网--两个栈模拟队列

题目

用两个栈来实现一个队列，完成队列的Push和Pop操作。 队列中的元素为int类型。

C++ AC代码

#include <iostream>
#include <stack>


using namespace std;


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

    int pop() {
        while (!this->stack1.empty()){
            this->stack2.push(this->stack1.top());
            this->stack1.pop();
        }
        int tmp = this->stack2.top();
        this->stack2.pop();
        return tmp;

    }

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