标准链表方法

#include <bits/stdc++.h>
using namespace std;
int n, m, x;
struct node {
	int data;
	node * next;
};
int main() {
	cin >> n;
	node * head, * r, * p;
	head = new node;
	head -> next = NULL;
    r = head;
	for(int i = 1; i <= n; i++) {
		cin >> x;
		p = new node;
		p -> data = x;
		p -> next = NULL;
		r -> next = p;
		r = p;
	}
    cin >> m;
    p = head;
    while(p -> next != NULL) {
        if(p -> next -> data == m) {
            p -> next = p -> next -> next;
        }
        else {
            p = p -> next;
        }
    }
	p = head;
	while(p -> next != NULL) {
		cout << p -> next -> data << ' ';
		p = p -> next;
	}
	return 0;
}