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

栈顶弹出后，切片，判断首项是否为新的栈顶

from re import T
class Solution:
    def IsPopOrder(self , pushV: List[int], popV: List[int]) -> bool:
        # write code here
        if sorted(popV)!=sorted(pushV):
            return False                                  
        while popV:
            v1=popV.index(pushV[-1])                       
            popV.pop(v1)
            if len(popV)<v1+1:
                return True                       
            cut=popV[v1:]
            cut=[pushV.index(i) for i in cut]
            if cut[0]==max(cut):               
                pushV.pop(-1)
                continue
            else:
                return False