思路:
一开始思路走偏了,尝试利用索引判断
不如直接模拟一个栈来操作
依次压入pushed列表,按popped顺序弹出
class Solution:
def validateStackSequences(self, pushed: List[int], popped: List[int]) -> bool:
stack=[]
i=0
for num in pushed:
stack.append(num)
while(len(stack)!=0 and stack[-1]==popped[i]):
stack.pop()
i=i+1
return len(stack)==0