题解 | #用两个栈实现队列#
用两个栈实现队列
https://www.nowcoder.com/practice/54275ddae22f475981afa2244dd448c6
class Solution { public: void push(int node) { stack1.push(node); } int pop() { if (!stack2.size()) { while (stack1.size()) { int tmp = stack1.top(); stack1.pop(); stack2.push(tmp); } } int ret = stack2.top(); stack2.pop(); return ret; } private: stack<int> stack1; stack<int> stack2; };