我是老6 • 5天前
提交时间:2025-08-29 15:32:29
运行 ID: 315254
using namespace std;
struct node {
int data;
node *next;
} head, p, *q;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
p = new node;
cin >> p->data;
if (head == NULL) {
p->next = NULL;
head = q = p;
} else {
q->next = p;
q = p;
}
}
int x;
cin >> x;
while(head->data==x)
head=head->next;
p=head;
while (p->next!=NULL) {
if (p->next->data == x)
p->next = p->next->next;
else
p = p->next;
}
p=head;
while (p != NULL) {
cout << p->data << " ";
p = p->next;
}
return 0;
}
© 2019 - 2025王码编程 滇ICP备19007937号-1如果您有任何问题,请联系
评论:
请先登录,才能进行评论