31. 栈的压入、弹出序列

class Solution:
    def validateStackSequences(self, pushed: List[int], popped: List[int]) -> bool:

        stack = []
        while popped:
            if pushed and pushed[0] == popped[0]:
                pushed.pop(0)
                popped.pop(0)
            elif stack and stack[-1] == popped[0]:
                stack.pop()
                popped.pop(0)
            elif pushed:
                stack.append(pushed.pop(0))
            else:
                return False
        return True

标签：popped,压入,int,31,elif,pop,pushed,序列,stack
来源： https://blog.csdn.net/Chang_Shuang/article/details/116545057