Function StackCheck

DataStructure/Stack/StackCheck.js:11–37 · view source on GitHub ↗

* 输入两个整数序列，第一个序列表示栈的压入顺序，请判断第二个序列是否为该栈的弹出顺序。假设压入栈的所有数字均不相等。 * * @param {Array} pushOrder * @param {Array} popOrder * @return {Boolean}

(pushOrder, popOrder)

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Stack.test.jsFile · 0.50

peekMethod · 0.45

pushMethod · 0.45

popMethod · 0.45

no test coverage detected