MCPcopy Create free account
hub / github.com/Reaper622/DataStructure-Algorithm-TS / StackCheck

Function StackCheck

DataStructure/Stack/StackCheck.ts:10–36  ·  view source on GitHub ↗

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

(pushOrder: Array<T>, popOrder: Array<T>)

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Callers

nothing calls this directly

Calls 3

peekMethod · 0.95
pushMethod · 0.95
popMethod · 0.95

Tested by

no test coverage detected