用两个栈实现队列

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

classSolution

{

public:

    voidpush(intnode)

    {

        stack1.push(node);

    }

 

    intpop()

    {

        inta =  0;

        if(stack2.empty())

        {

            while(!stack1.empty())

            {

                a = stack1.top();

                stack2.push(a);

                stack1.pop();

            }

        }

        a = stack2.top();

        stack2.pop();

        returna;

    }

 

private:

    stack<int> stack1;

    stack<int> stack2;

};