题解 | 从单向链表中删除指定值的节点

#include<bits/stdc++.h>
using namespace std;
const int N = 1e4 + 10;

int n, h, ne[N], e[N], idx = 1, m;

void add(int u, int v) {
	ne[v] = ne[u], e[idx] = v, ne[u] = idx++;
}

int main() {
	cin >> n >> h;
	ne[0] = -1;
	add(0, h);
	for (int i = 1, u, v; i < n; i++) {
		cin >> v >> u;
		add(u, v);
	}
	cin >> m;
	for (int i = ne[0]; ~i; i = ne[e[i]]) {
		if (e[i] == m) continue;
		cout << e[i] << " ";
	}
	return 0;
}