JavaScript 用两个栈实现队列

/*
* 把一个栈完全倒进另一个栈就可以用两个栈模拟实现一个队列
* */
let inStack = []
let outStack = []

function pushNode (node) {
    inStack.push(node)
}
function popNode () {
    if (inStack.length === 0 && outStack.length === 0) return
    if (outStack.length === 0) {
        for (let i = inStack.length ; i > 0 ; i--) {
            outStack.push(inStack.pop())
        }
    }
    return outStack.pop()
}

pushNode(8)
pushNode(9)
pushNode(1)

console.log(popNode())
console.log(popNode())
console.log(popNode())