leetcode_validate stack sequences

Validate Stack Sequences

Given two sequences pushed and popped with distinct values, return true if and only if this could have been the result of a sequence of push and pop operations on an initially empty stack.
（判断有效的栈压入、压出序列）

Note:

1. 0 <= pushed.length == popped.length <= 1000
2. 0 <= pushed[i], popped[i] < 1000
3. pushed is a permutation of popped.
4. pushed and popped have distinct values.

Example:

1. 模拟栈

1
2
3
4
5
6
7
8
9
10

class :
    def validateStackSequences(self, pushed: List[int], popped: List[int]) -> bool:
        temp_stack = []
        while pushed:
            top = pushed.pop(0)
            temp_stack.append(top)
            while temp_stack and popped and popped[0] == temp_stack[-1]:
                popped.pop(0)
                temp_stack.pop()
        return not temp_stack