#include<stdio.h> #include<stdlib.h> typedef struct Node{ int data; struct Node* next; }Node; void AddAtEnd(Node**head, int data){ Node* new_node = (Node*)malloc(sizeof(Node)); new_node->data = data; new_node->next = NULL; if(*head ==NULL) { *head = new_node; return; } Node* cur = *head; while(cur->next!=NULL) { cur = cur->next; } cur->next = new_node; } void deleteNode(Node** head,int a){ if(*head == NULL) return; //链表为空无需删除 else if((*head)->next == NULL&&(*head)->data == a)//光棍头节点恰好被全删了 { *head = NULL; return; } Node* cur = *head; Node* prev = NULL; while(cur->next!=NULL) { prev = cur; cur = cur->next; if(cur->data == a) { prev->next = cur->next; return; } } } void showNode(Node* head){ if(head == NULL) { printf("空链表!"); return; } Node* cur = head; while(cur!=NULL) { printf("%d ",cur->data); cur = cur->next; //cur肯定非空,如果cur是最后一个,这句就会给cur赋值NULL,下一轮就不会继续循环了 } printf("\n"); } int main(){ int n,n1,m; Node* head = NULL; scanf("%d",&n); n1=n; while (n--) { scanf("%d",&m); AddAtEnd(&head,m); } int a; scanf("%d",&a); while(n1--) deleteNode(&head,a); showNode(head); return 0; }
0.0分
0 人评分
C语言训练-求1+2!+3!+...+N!的和 (C语言代码)浏览:790 |
WU-整除问题 (C++代码)浏览:612 |
C语言程序设计教程(第三版)课后习题10.4 (C语言代码)浏览:549 |
C语言程序设计教程(第三版)课后习题6.2 (C语言代码)浏览:690 |
C语言程序设计教程(第三版)课后习题8.9 (C语言代码)浏览:833 |
1017题解浏览:605 |
DNA (C语言代码)浏览:749 |
C语言程序设计教程(第三版)课后习题11.3 (C语言代码)浏览:577 |
分糖果 (C语言代码)浏览:920 |
输出九九乘法表 (C语言代码)浏览:1048 |