剑指offer 两个栈实现队列

[code]#include <iostream>
#include <stack>

using namespace std;

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

    int pop() {

        /* 把栈1的数据压入栈2 */
        while(!stack1.empty())
        {
            stack2.push(stack1.top());
            stack1.pop();
        }

        /* 得到栈2栈顶的元素 */
        int data = stack2.top();
        stack2.pop();

        /* 把数据压入栈1 */
        while(!stack2.empty())
        {
            stack1.push(stack2.top());
            stack2.pop();
        }
        return data;
    }

private:
    stack<int> stack1;
    stack<int> stack2;
};
int main()
{
    Solution s;
    s.push(1);
    s.push(2);
    s.push(3);

    cout << s.pop() << endl;
    cout << s.pop() << endl;

    return 0;
}