题解 | 验证栈序列

#include <bits/stdc++.h>
using namespace std;
int main() {
	int e;
	cin >> e;
	for (int v = 1; v <= e; v++) {
		int n;
		cin >> n;
		vector<int> a(n);
		vector<int> b(n);
		stack<int> c;
		vector<int> y;
		for (int m = 0; m < n; m++) {
			cin >> a[m]; 
		}
		for (int m = 0; m < n; m++) {
			cin >> b[m]; 
		}
		int q = 0;
		for (int m = 0; m < n; m++) {
			if (a[m] != b[q]) {
				c.push(a[m]);
			}
			if (a[m] == b[q]) {
				y.push_back(a[m]);
				q++;
				while (!c.empty() && c.top() == b[q]) {
					y.push_back(c.top());
					c.pop();
					q++;
				}
			}
		}
		while (!c.empty()) {
			y.push_back(c.top());
			c.pop();
		}
		if (y == b) {
			printf("Yes\n");
		} else {
			printf("No\n");
		}
	}
	return 0;
}