学生课程管理.docVIP

#includeiostream.h #includestring.h typedef struct student { long int num; char name[20]; struct student * next; }stud; stud * create_list(); int insert_list(stud * head,char * name,int n); int del_list(stud * head,char* name); stud * find_list(stud * head,char * name); void brow_list(stud * head); void main() { stud * head; int choice; char name[8]; head=NULL; cout1. 建立链表\n; cout2. 插入新生\n; cout3. 查找学生\n; cout4. 删除学生\n; cout5. 数据浏览\n; cout0. 退出程序\n; do { cout请选择操作（输入0-5）\n; cinchoice; if(choice5||choice0) { cout输入错误!\a\n; continue; } switch(choice) { case 1: if(head==NULL) head=create_list(); break; case 2: if(head==NULL) { cout链表未建立！\n; break; } while(1) { cout姓名（输入0结束）：; cinname; if(strcmp(name,0)==0) break; insert_list(head,name,-1); } break; case 3: cout输入姓名:; cinname; find_list(head,name); break; case 4: cout输入姓名:; cinname; del_list(head,name); break; case 5: brow_list (head); break; default: return; } }while(1); } stud* create_list() { stud* head; head=new stud; if(head!=NULL) cout链表已建立！\n; else cout没有足够内存空间！\a\n; head-next=NULL; head-num=0; return head; } int insert_list(stud* head,char*name,int n) { stud *p,*q,*s; s=new stud; if(s==NULL) { cout没有足够内存空间!\a\n; return 0; } q=head; p=head-next; while(p!=NULLn!=q-num) { q=p; p=p-next; } q-next=s; s-next=p; strcpy(s-name,name); s-num=q-num+1; return 1; } stud* find_list(stud*head,char*name) { stud*p; p=head; while(p!=NULLstrcmp(p-name,name)) { p=p-next; } if(p!=NULL) { cout学号：p-num 姓名：p-name\n; } else cout查无此人！\n; return p; } int del_list (stud*head,char *name ) { stud*p,*q; q=head; p=head-next; while(p!=NULLstrcmp(p-name,name)) { q=p; p=p-next; } if(p!=NULL) { q-next=p-next; delete p; cout删除完成！\n; return 1; } else { cout查无此人！\a\n; return 0; } } void brow_list (stud *head) { stud*p;