- Problem

946. Validate Stack Sequences

- 내 풀이

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

        for e in pushed:
            stk.append(e)
            while stk and stk[-1] == popped[0]:
                stk.pop() 
                popped.popleft()
        
        return not stk

- 결과

• 시간 복잡도: O(N) (N: pushed 길이)