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

# -*- coding:utf-8 -*-
class Solution:
    def IsPopOrder(self, pushV, popV):
        # write code here
        i = 0
        j = 0
        while pushV:
            if pushV[i] != popV[j]:
                i += 1
                if i>=len(pushV):
                    return False
            else:
                print(pushV, i)
                pushV.pop(i)
                j += 1
                i -= 1
        return True