题解 | 验证栈序列

#看不懂题目的朋友可以先做下一道题目，然后再回来做这道，就能简单很多。
q = int(input())
for _ in range(q):
    n = int(input())
    pushed = input().split()
    popped = input().split()
    push = []
    pop = []
    for ele in pushed:
        push.append(ele)
        while push and push[-1] == popped[len(pop)]:
            pop.append(push[-1])
            push.pop()
    pop = pop + push[::-1]
    if pop == popped:
        print('Yes')
    else:
        print('No')