题解 | #用两个栈实现队列#
用两个栈实现队列
http://www.nowcoder.com/practice/54275ddae22f475981afa2244dd448c6
var stack1 = []
var stack2 = []
function push(node)
{
// write code here
stack1.push(node)
}
function pop()
{
// write code here
if(!stack2.length){
while(stack1.length){
stack2.push(stack1.pop())
}
}
return stack2.pop()
}
module.exports = {
push : push,
pop : pop
};
var stack2 = []
function push(node)
{
// write code here
stack1.push(node)
}
function pop()
{
// write code here
if(!stack2.length){
while(stack1.length){
stack2.push(stack1.pop())
}
}
return stack2.pop()
}
module.exports = {
push : push,
pop : pop
};
，这还是稳定一个月2.5w的前提，草了
