1、1這是主文件建立文件“ student-main.cpp ”粘貼保存#include#include#include#include#includestudent-fun.cpp”#define PRINT %6d%12s%5.2fn”,p-num,p-name,p-score /定義輸出格式#define PRINTF 學(xué)號(hào)姓名成績n”char cmd; int num; lklist L;void jiemian() ( system(cls);printf(n*);printf(n*，printf(n*，printf(n*i-增加學(xué)生*，printf(n*f-查詢*，歡迎使用簡易班級(jí)學(xué)生

2、信息系統(tǒng)d-刪除學(xué)生q-退出系統(tǒng)c-修改l-列出所有學(xué)生信息printf(n“ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ 個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)個(gè)*n);void ReadCommand()do printf(n請(qǐng)根據(jù)提示輸入命令：);fflu

3、sh(stdin);清除文件緩沖區(qū)，文件以寫方式打開時(shí)將緩沖區(qū)內(nèi)容寫入文件scanf(%c,&cmd); while (cmd!=i&cmd!=d&cmd!=T&cmd!=q&cmd!=f&cmd!=c);void Interpret()switch(cmd)case i: insert_lklist(L); break;case d: del_lklist(L);break;case l: list_lklist(L); break;case f: find_lklist(L);break;case c: cor_lklist(L);break;case q: exit(0);void ma

4、in()L=initial_lklist();do jiemian();ReadCommand();Interpret();system(pause); 暫停，按任意鍵繼續(xù)。 while(cmd!=Q&cmd!=q);2下邊是功能部分新建一個(gè)student-fun.cpp 文件粘貼#include#include#define PRINT %6d%12s%5.2fn”,p-num,p-name,p-score /定義輸出格式#define PRINTF 學(xué)號(hào)姓名成績n”struct nodecharname15;intnum;float score;struct node *next;type

5、def struct node* pointer;typedef pointer lklist;Iklist initial_lklist()初始化單鏈表。( pointer t;t=(node*)malloc(sizeof(node);t-next=NULL;return t;void find_lklist(lklist head) 按序號(hào)查找。int i;printf(n請(qǐng)輸入學(xué)號(hào)：”)； scanf(%d”,&i);lklist q;pointer p=head;while( (p =NULL)&(p-num!=i) ) p=p-next; if(p!=NULL)printf(PRIN

6、TF);printf(PRINT);else printf(信息不存在!n);int length_lklist(lklist head)pointer p=head;int j=0;while(p-next) j+; p=p-next; return j;void insert_lklist(lklist head) /插入一個(gè)值為x的元素在第i個(gè)位置， pointer s;if( s =(node*)malloc(sizeof(node) printf(n 請(qǐng)輸入學(xué)號(hào)：);scanf(%d”,&s-num);printf(n 請(qǐng)輸入姓名：”)；scanf(%s”,s-name);print

7、f(n 請(qǐng)輸入分?jǐn)?shù)：);scanf(%f”,&s-score);s-next=head-next;head-next=s;printf(n你已插入成功！ n);else printf(n 插入操作失敗！ n); return;void list_lklist(lklist head) printf(n 表中所有元素如下(共 %d 個(gè)元素)：”,length_lklist(head);, r/tf “ 3 ttprintf(n*n);printf(PRINTF);if (head-next=NULL) printf(n 表為空！ ！ ！ n); else pointer p=head-next;

8、while(p) printf(PRINT);p=p-next;, r/tf “ 3 ttpnntf(n*n);void del_lklist(lklist head)int i;printf(n請(qǐng)輸入學(xué)號(hào)：”)；scanf(%d”,&i);lklist q;pointer p=head; int j=0;while( (p!=NULL)&(p-next-num!=i) ) p=p-next; if(p!=NULL)q=p-next;if(q-next=NULL)free(q);elsep-next=q-next;free(q);printf(刪除成功!n);void cor_lklist(lklist head)int i;printf(n請(qǐng)輸入學(xué)號(hào)：”)；scanf(%d”,&i);lklist q;pointer p=head;while( (p!=NULL)&(p-ne