题解 | #栈的压入、弹出序列#

class Solution: def IsPopOrder(self, pushV, popV): stack = [] while pushV: stack.append(pushV.pop(0)) while stack and stack[-1] == popV[0]: stack.pop() popV.pop(0) return len(stack) == 0