C语言 建立 输出 插入 删除 修改功能的单项动态链表.doc

C语言链表类题目 写函数一个有三名学生数据的, 有建立 输出 插入 删除 修改功能的单项动态链表，很全面，各种测试都试过了，环境VC6.0 结构体为学号 成绩 #include stdio.h #include string.h #include malloc.h struct Student { long num; float score; struct Student* next; struct Student *pre; }; int n=0; struct Student* create(void) { struct Student *head; struct Student *tail; struct Student *pre; struct Student *p; head = NULL; pre = NULL; p=(struct Student*)malloc(sizeof(struct Student)); printf(请输入用户名和得分:\n); scanf(%ld %f,p-num,p-score); if (0 == p-num) { return NULL; } while(0 != p-num) { n++; if (NULL == head) { head=p; tail=p; pre = NULL; tail-next = NULL; } else { pre = tail; tail-next=p; tail=p; } p=(struct Student*)malloc(sizeof(struct Student)); printf(请输入用户名和得分:\n); scanf(%ld%f,p-num,p-score); } if (NULL != pre) { tail-next=NULL; } return head; } void print(struct Student *head) { struct Student *p=head; if (NULL == p) { printf(该链表中还没有数据\n); } while (p !=NULL) { printf(%ld\t%.3f\n,p-num,p-score); p=p-next; } } struct Student *del(struct Student *head, long num) { struct Student *p1 = head; struct Student *p2 = head; if (NULL == head) { return NULL; } if (NULL == head-next) { if (num == head-num) { n--; return NULL; } else { return head; } } if (num == head-num) { n--; head=head-next; return head; } if (NULL == head-next-next) { if (num == head-next-num) { n--; head-next = NULL; return head; } } p1 = head-next; while (p1!=NULL) { if (num == p1-num) { n--; if (NULL == p1-next) { p2-next = NULL; } else { p2-next = p1-next; } } p1 = p1-next; p2 = p2-next; } return head; } struct Student *alter(struct Student *head, long num, float score) { struct Student *p = head; while (p!=NULL) { if (num == p-num) { p-score = score; } p = p-next; } return head; } struct Student *insert(struct Student *head, long num, float sco