题解 | #用两个栈实现队列#

用C语言如何模拟实现栈的功能呢 class Solution { public: void push(int node) { while(!stack2.empty()){ int val = stack2.top(); stack1.push(val); stack2.pop(); } stack2.push(node); }

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

private: stack stack1; stack stack2;

};