栈的压入、弹出序列

def solve(____):
    pushed = list(map(int, pushed.split(____)))
    popped = list(map(int, popped.split(____)))
    stack = []
    i = ____
    for num in pushed:
        stack.append(____)
        while stack and i < len(____) and stack[-____] == popped[i]:
            stack.pop()
            i += ____
    print('____' if i == len(____) else '____')