题解 | #用两个栈实现队列#
用两个栈实现队列
https://www.nowcoder.com/practice/54275ddae22f475981afa2244dd448c6
let stack1=[];
let stack2=[];
function push(node)
{
// write code here
stack1.push(node);
}
function pop()
{
// write code here
if(stack2.length==0){
while(stack1.length>0){
stack2.push(stack1.pop());
}
}
return stack2.pop();
}
module.exports = {
push : push,
总的思路是将栈1的内容再放到栈2中再出栈，这样正好满足队列先进先出的特性
