大連東軟小學(xué)期C語(yǔ)言項(xiàng)目學(xué)生成績(jī)管理系統(tǒng)代碼

1、/*鏈表版學(xué)生成績(jī)管理系統(tǒng)的main函數(shù)與鏈表構(gòu)建模塊的代碼*/#include <stdio.h>#include <stdlib.h>#include <string.h>struct STUDENT char name 20 ;int score;struct STUDENT * next; void showMenu( );struct STUDENT* createList( );void outputList(struct STUDENT * head);void searchByName(struct STUDENT * head);void

2、deleteByName(struct STUDENT * head);struct STUDENT * add(struct STUDENT * head);int main( ) struct STUDENT *head = NULL;int select;while(1)showMenu();scanf("%d",&select);switch(select)case 1:head = createList( );break;case 2:outputList(head);break;case 3:searchByName(head);break;case 4

3、:deleteByName(head);break;case 5:head = add(head);break;case 6:printf("系統(tǒng)即將退出.");exit(0);return 0;/*顯示系統(tǒng)菜單*/void showMenu( )printf("1-錄入學(xué)生成績(jī)n");printf("2-輸出成績(jī)清單n");printf("3-按姓名搜索記錄n");printf("4-按姓名刪除記錄n");printf("5-追加錄入學(xué)生成績(jī)n");printf("

4、;6-退出系統(tǒng)n");printf("請(qǐng)選擇(1-6):n");/*鏈表構(gòu)建模塊*/struct STUDENT* createList( )struct STUDENT * head,*p,*q;char name 20 ;p = (struct STUDENT *)malloc(sizeof(struct STUDENT); /p指針總指向新開辟的節(jié)點(diǎn)head = p; /頭結(jié)點(diǎn)中沒(méi)有學(xué)生成績(jī)信息q = p; /q指針總是指向尾節(jié)點(diǎn)q->next = NULL; /標(biāo)志鏈表的結(jié)束printf("請(qǐng)輸入學(xué)生姓名（輸入none表示輸入結(jié)束）：&qu

5、ot;);scanf("%s", name);while(strcmp(name, "none") !=0 ) / name是none標(biāo)志輸入結(jié)束 p = (struct STUDENT *)malloc(sizeof(struct STUDENT); /申請(qǐng)新的節(jié)點(diǎn)內(nèi)存 strcpy(p->name, name); printf("請(qǐng)輸入分?jǐn)?shù)："); scanf("%d", &p->score); q->next = p; /把新節(jié)點(diǎn)掛到原尾節(jié)點(diǎn)之后 q = q->next; /q

6、指針指向新的尾節(jié)點(diǎn) printf("請(qǐng)輸入姓名（輸入none表示輸入結(jié)束）："); scanf("%s", name);q->next = NULL; /標(biāo)志鏈表的結(jié)束return head;/*輸出鏈表中的所有記錄清單*/void outputList(struct STUDENT * head )struct STUDENT * p;if(head=NULL)printf("鏈表為空。n");return;for ( p = head->next; p != NULL; p = p->next ) printf(

7、 "姓名： %s , 分?jǐn)?shù)： %d n", p->name, p->score );/*根據(jù)姓名在鏈表中查找記錄,并輸出其信息*/void searchByName(struct STUDENT * head)char name20;struct STUDENT * p;if(head=NULL)printf("鏈表為空。n");return;printf("請(qǐng)輸入要查找的學(xué)生的姓名：");scanf("%s",name);for(p=head->next;p!=NULL;p=p->next

8、)if(strcmp(p->name,name)=0)break;if(p=NULL)printf("沒(méi)有找到！");elseprintf( "姓名： %s , 分?jǐn)?shù)： %d n", p->name, p->score );/*根據(jù)姓名刪除鏈表的中的學(xué)生記錄*/void deleteByName(struct STUDENT * head)struct STUDENT *p,*q;char name20;if(head=NULL)printf("鏈表為空。n");return;printf("請(qǐng)輸入要?jiǎng)h除的

9、學(xué)生的姓名：");scanf("%s",name);for(p=head->next,q=head;p!=NULL;p=p->next,q=q->next)if(strcmp(p->name,name)=0)q->next=p->next;if(p=NULL)printf("刪除結(jié)束。n");elsefree(p);/*在鏈表的尾部，添加一個(gè)節(jié)點(diǎn)*/struct STUDENT * add(struct STUDENT * head)struct STUDENT * p,*q;if(head=NULL)/若head指針為空，則建一個(gè)沒(méi)有數(shù)據(jù)的頭結(jié)點(diǎn)。p = (struct STUDENT *)malloc(sizeof(struct STUDENT); head = p; /頭結(jié)點(diǎn)中沒(méi)有學(xué)生成績(jī)信息head->next = NULL; p = (struct STUDENT *)malloc(sizeof(struct STUDENT); /申請(qǐng)新的節(jié)點(diǎn)內(nèi)存printf("請(qǐng)輸入姓名：");scanf("%s",p->name);printf("請(qǐng)輸入分?jǐn)?shù)：");scanf("%d&