每日一练之用两个栈实现队列

用两个栈实现队列

OJ 地址：用两个栈实现队列

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

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

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