function IsPopOrder(pushV, popV) { if (!pushV || !popV || pushV.length !== popV.length) { return; } const stack = new Stack(); let j = 0; for (let i = 0; i < pushV.length; i++) { stack.push(pushV[i]); //遍历push栈 while (!stack.isEmpty() && stack.peek() == popV[j]) { ...