class Solution2:
def IsPopOrder(self, pushV, popV):
stack = []
for i in range(len(pushV)):
stack.append(pushV[i])
while len(stack) and stack[-1] == popV[0]:
stack.pop()
popV.pop(0)
return stack == []
需要用到一个临时栈来存放入栈的元素,当元素相同时,开始弹出。