给定 pushed
和 popped
两个序列,只有当它们可能是在最初空栈上进行的推入 push 和弹出 pop 操作序列的结果时,返回 true
;否则,返回 false
。
示例 1:
输入:pushed = [1,2,3,4,5], popped = [4,5,3,2,1]
输出:true
解释:我们可以按以下顺序执行:
push(1), push(2), push(3), push(4), pop() -> 4,
push(5), pop() -> 5, pop() -> 3, pop() -> 2, pop() -> 1
示例 2:
输入:pushed = [1,2,3,4,5], popped = [4,3,5,1,2]
输出:false
解释:1 不能在 2 之前弹出。
提示:
0 <= pushed.length == popped.length <= 1000
0 <= pushed[i], popped[i] < 1000
pushed
是popped
的排列。
思路:
开辟一个栈stack来模拟入栈出栈的操作,对于pushed里的每一个元素,都进行一次入栈,
入栈之后比较当前的栈顶和队列头是否相同,如果相同,则栈顶和队头同时POP。
当pushed里的每一个元素都扫描结束时,如果stack为空,说明pushed和popped数组匹配成功,返回True;如果不为空,就说明不对,返回False。
class Solution(object):
def validateStackSequences(self, pushed, popped):
"""
:type pushed: List[int]
:type popped: List[int]
:rtype: bool
"""
stack = []
i = 0
for item in pushed:
stack.append(item)
while(stack and popped[i] == stack[-1]):
stack.pop()
i += 1
return stack == []
#下面是修改前
class Solution(object):
def validateStackSequences(self, pushed, popped):
"""
:type pushed: List[int]
:type popped: List[int]
:rtype: bool
"""
l = len(pushed)
stack = list()
for i in range(0, l):
stack.append(pushed[i])
while(stack and stack[-1] == popped[0]):
stack = stack[:-1]
popped = popped[1:]
return stack == []