1
struct Node {
2
  int data;
3
  Node *next;   //自引用，构建链表，链表中每个结点有两部分，数据域data和指针域next，data存值，next指向下一个结点
4
} *head, *p, *r;         //头指针，指针，尾指针

1
void set(int a[], int n) {  //尾插
2
  head = new Node; head -> next = NULL; r=head;    //刚开始是r和head是在一起的，便于尾插操作
3
  for (int i = 1; i <= n; i++) {
4
    p = new Node;
5
    p -> data = a[i];
6
    p -> next = NULL;
7
    r -> next = p;         //将p插到r后面
8
    r = p;                      //r后移
9
  }
10
}

1
void insert(int a[], int pos, int val) {    //详见模拟图
2
  p = head;          //从头开始
3
  int i = 0;
4
  while (p != NULL && i < pos - 1) {
5
    p = p -> next;      //p指向下一个结点
6
    i++;
7
  }
8
  Node *s;
9
  s = new Node;
10
  s -> data = val;
11
  s -> next = p -> next;
12
  p -> next = s;
13
}

1
void del(int a[], int pos) {      //详见模拟图
2
  p = head;
3
  int i = 0;
4
  while (p != NULL && i < pos - 1) {
5
    p = p -> next;
6
    i++;
7
  }
8
  Node *s;
9
  s = new Node;
10
  s = p -> next;
11
  p -> next = s -> next;
12
  delete[] s;
13
}

1
void print() {
2
  p = head -> next;
3
  while (p -> next != NULL) {
4
    cout << p -> data << " ";
5
    p = p -> next;
6
  }
7
  cout << p -> data << endl;
8
}

1
int main() {
2
  int n;
3
  cin >> n;
4
  int a[200000];
5
  for (int i = 1; i <= n; i++) {
6
    cin >> a[i];
7
  }
8
  set(a, n);
9
  int m;
10
  cin >> m;
11
  for (int i = 1; i <= n; i++) {
12
    if (a[i] == m) {
13
      del(a, i);
14
    }
15
  }
16
  print();
17
  delete[] p;     //防内存泄漏
18
    delete[] head;
19
  return 0;
20
}