题解 | 用两个栈实现队列
用两个栈实现队列
https://www.nowcoder.com/practice/54275ddae22f475981afa2244dd448c6
class Solution{public:void push(int node) {stack1.push(node);}
int pop() {
for (int i = 0; i < stack1.size() - 1; i++)
{
stack2.push(stack1.top());
stack1.pop();
}
int current = stack1.top();
stack1.pop();
while(!stack2.empty())
{
stack1.push(stack2.top());
stack2.pop();
}
return current;
}
private:stack<int> stack1;stack<int> stack2;};
查看4道真题和解析