题解 | #用两个栈实现队列#
用两个栈实现队列
https://www.nowcoder.com/practice/54275ddae22f475981afa2244dd448c6
//定义两个数组来作为栈
let stack1=[];
let stack2=[]
function push(node)
{
// write code here
//让元素只从stack1中进去,从stack2中出来
return stack1.push(node)
}
function pop()
{
// write code here
//判断一下stack2是否为空
if(stack2.length ==0){
while(stack1.length !== 0)
{
stack2.push(stack1.pop())
}
}
return stack2.pop()
}
module.exports = {
push : push,
pop : pop
};
let stack1=[];
let stack2=[]
function push(node)
{
// write code here
//让元素只从stack1中进去,从stack2中出来
return stack1.push(node)
}
function pop()
{
// write code here
//判断一下stack2是否为空
if(stack2.length ==0){
while(stack1.length !== 0)
{
stack2.push(stack1.pop())
}
}
return stack2.pop()
}
module.exports = {
push : push,
pop : pop
};