题解 | 验证栈序列

#include<bits/stdc++.h>
using namespace std;
int main(){
    int q,b;
    cin>>q;
    while(q--){
        vector<int> zhan;
        cin>>b;
        vector<int> pushed(b);
        vector<int> popped(b);
        for(int i=0;i<b;i++){
            cin>>pushed[i];
        }
        for(int i=0;i<b;i++){
            cin>>popped[i];
        }
        int k=0;
        for(int i=0;i<b;i++){
            zhan.push_back(pushed[i]);
            for(int j=0;j<b;j++){
                if(zhan[zhan.size()-1]==popped[k]){
                    zhan.pop_back();
                    k++;
                    if(k>=b){
                        break;
                    }
                }
                else{
                    break;
                }
            }
        }
        if(zhan.size()==0){
            cout<<"Yes"<<endl;
        }
        else{
            cout<<"No"<<endl;
        }
    }
    return 0;
}