标签：private   void   vat   top   return   node   用两个   两个栈   ack   

剑指OFFER 用两个栈实现队列

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

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

    }

private:
    stack<int> stack1;
    stack<int> stack2;
};class Solution
{
public:
    void push(int node) {
        stack1.push(node);
    }

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

    }

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

剑指OFFER 用两个栈实现队列

标签：private   void   vat   top   return   node   用两个   两个栈   ack   

原文地址：https://www.cnblogs.com/virgildevil/p/12227972.html