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

#
# 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
#
# 
# @param pushV int整型一维数组 
# @param popV int整型一维数组 
# @return bool布尔型
#
class Solution:
    def IsPopOrder(self , pushV: List[int], popV: List[int]) -> bool:
        # write code here        
        stack = []
        popV.reverse()
        for val in pushV:
            while stack and stack[-1] == popV[-1]:
                stack.pop()
                popV.pop()
            stack.append(val)
        while stack or popV:
            if stack[-1] == popV[-1]:
                stack.pop()
                popV.pop()
            else:
                break
        
        if stack or popV:
            return False
        else:
            return True