1、#include #include #include /清屏函數(shù)頭文件#include struct Stuff char number10; /員工編號(hào) char name10; /員工姓名 char sex8; /員工性別 char borth10; /員工生日 char degree20; /員工學(xué)歷 char business20; /員工職務(wù) char phone15; /員工電話 char place50; /員工住址 char con50; /判斷關(guān)鍵字專用 struct Stuff *next; ;char Menu(void); /菜單顯示struct Stuff *App(

2、struct Stuff *head); /添加void Sort(struct Stuff *head); /排序struct Stuff *Ser(struct Stuff *head); /查找void Chn(struct Stuff *head,char n10); /更改void Scpy(char *p,char *q); /排序中用于交換員工信息struct Stuff *Del(struct Stuff *head,char n10); /刪除int Sel(char ch,struct Stuff *p,struct Stuff *q); /判斷排序及關(guān)鍵字專用函數(shù)void

3、 Prf(struct Stuff *head); /輸出void Fre(struct Stuff *head); /釋放int i=1; /定義全局變量，實(shí)現(xiàn)實(shí)時(shí)員工人數(shù)統(tǒng)計(jì)int main(void) char n10; struct Stuff *head=NULL; /鏈表頭指針定義 while(1) switch(Menu() case 1: printf(請(qǐng)輸入員工信息，直接輸入#結(jié)束n); head=App(head); break; case 2: Sort(head); break; case 3: head=Ser(head); break; case 4: printf

4、(員工信息如下:n); Prf(head); break; case 5: printf(請(qǐng)輸入員工編號(hào):); scanf(%s,n); Chn(head,n); break; case 6: printf(請(qǐng)輸入員工編號(hào):); scanf(%s,n); head=Del(head,n); break; case 0: printf(歡迎下次光臨，88!n); exit(0); default: printf(輸入錯(cuò)誤，請(qǐng)重新輸入!n); fflush(stdin); /清楚緩沖區(qū) printf(按任意鍵繼續(xù)); getchar(); system(cls); /清屏效果 Fre(head);

5、 return 0;/菜單函數(shù)char Menu(void) char ch; printf(-請(qǐng)選擇-n); printf(1.添加員工信息n2.員工信息排序n3.查找員工信息n4.輸出員工信息n5.更改員工信息n6.刪除員工信息n0.退出n-n); scanf( %c,&ch); return ch;/添加成員函數(shù)/輸入?yún)?shù):鏈表頭指針/返回參數(shù):鏈表頭指針struct Stuff *App(struct Stuff *head) struct Stuff *p=NULL,*q=head; while(i) p=(struct Stuff *)malloc(sizeof(struct St

6、uff); /申請(qǐng)結(jié)構(gòu)體空間 if(p=NULL) printf(內(nèi)存不夠!n); exit(0); p-next =NULL; /指針域?yàn)榭?printf(請(qǐng)輸入第%d名員工:n,i); printf( 編號(hào) | 姓名 | 性別 | 出生年月 | 學(xué)歷 | 職務(wù) | 電話 | 住址 :n); fflush(stdin); scanf(%s,p-number ); if(!strcmp(p-number ,#) free(p); /釋放不需要的結(jié)構(gòu)體內(nèi)存 break; else +i; scanf(%s%s%s%s%s%s%s,p-name ,p-sex ,p-borth ,p-degree

7、,p-business ,p-phone ,p-place ); p-con0=0; /防止后面判斷出現(xiàn)隨機(jī)值 if(head=NULL) head=p; else while(q-next !=NULL) /防止結(jié)束后再次輸入時(shí)出現(xiàn)問(wèn)題 q=q-next ; q-next =p; q=p; /每次都加在鏈表尾 return head;/排序函數(shù)/輸入?yún)?shù):頭指針void Sort(struct Stuff *head) char ch; struct Stuff *p,*q,*r; while(1) printf(請(qǐng)選擇排序條件:1.編號(hào)2.姓名3.性別4.出生年月5.學(xué)歷6.職務(wù)7.電話8

8、.地址0.退出n); scanf( %c,&ch); if(ch=0) break; if(ch8) printf(輸入錯(cuò)誤，請(qǐng)重新輸入!n); continue; p=head; while(p-next!=NULL) /選擇排序 q=p-next; r=p; while(q!=NULL) if(Sel(ch,r,q) /調(diào)用判斷函數(shù) r=q; q=q-next; if(r!=p) /交換內(nèi)容 Scpy(r-number,p-number); Scpy(r-name,p-name); Scpy(r-sex,p-sex); Scpy(r-borth,p-borth); Scpy(r-degre

9、e,p-degree); Scpy(r-business,p-business); Scpy(r-phone,p-phone); Scpy(r-place,p-place); p=p-next; Prf(head); /輸出 /交換函數(shù)void Scpy(char *p,char *q) char c50; strcpy(c,p); strcpy(p,q); strcpy(q,c);/判斷函數(shù)/輸出參數(shù):1為真，0為假int Sel(char ch,struct Stuff *p,struct Stuff *q) switch(ch) /實(shí)現(xiàn)各個(gè)關(guān)鍵字查找 case 1: return str

10、cmp(q-number ,p-number )con ,p-number )=0 ; /排序條件及查找條件 case 2: return strcmp(q-name ,p-name )con ,p-name )=0 ; case 3: return strcmp(q-sex ,p-sex )con ,p-sex )=0 ; case 4: return strcmp(q-borth ,p-borth)con ,p-borth )=0 ; case 5: return strcmp(q-degree ,p-degree )con ,p-degree )=0 ; case 6: return s

11、trcmp(q-business ,p-business )con ,p-business)=0 ; case 7: return strcmp(q-phone ,p-phone )con ,p-phone)=0; case 8: return strcmp(q-place ,p-place )con ,p-place )=0; default : exit(0); /查找函數(shù)struct Stuff *Ser(struct Stuff *head) struct Stuff *p=NULL,*q,a=0,0,0,0,0,0,0,0; /防止判斷時(shí)錯(cuò)誤 int flag; /查找判斷 char

12、 ch,sh; q=&a; while(1) printf(請(qǐng)輸入要查找的條件:1.編號(hào)2.姓名3.性別4.出生年月5.學(xué)歷6.職務(wù)7.電話8.住址0.退出n); scanf( %c,&ch); if(ch=0) break; if(ch8) printf(輸入錯(cuò)誤，請(qǐng)重新輸入!n); continue; fflush(stdin); printf(請(qǐng)輸入:); gets(q-con ); p=head; /指向表頭 flag=0; while(p!=NULL) if(Sel(ch,p,q) printf(員工信息如下:n); printf( 編號(hào) | 姓名 | 性別 | 出生年月 | 學(xué)歷

13、| 職務(wù) | 電話 | 住址 n%s %s %s %s %s %s %s %sn ,p-number ,p-name ,p-sex ,p-borth ,p-degree ,p-business ,p-phone ,p-place ); printf(是否需要:1.更改 2.刪除 3.繼續(xù)n); scanf( %c,&sh); if(sh=1) Chn(head,p-number); /調(diào)用更改函數(shù) else if(sh=2) head=Del(head,p-number); /調(diào)用刪除函數(shù)，得到的head必須return flag=1; break; p=p-next ; if(flag=0)

14、 printf(沒(méi)有找到該員工信息!n); return head;/更改函數(shù)/輸入?yún)?shù):n10 為員工編號(hào)void Chn(struct Stuff *head,char n10) struct Stuff *p=head; int flag=0; if(head=NULL) printf(未找到員工信息!n); else while(p!=NULL) if(!strcmp(p-number,n) printf(請(qǐng)輸入新的信息:n編號(hào)|姓名|性別|出生年月|學(xué)歷|職務(wù)|電話|住址n); scanf(%s%s%s%s%s%s%s%s,p-number ,p-name ,p-sex ,p-bor

15、th ,p-degree ,p-business ,p-phone ,p-place ); printf(員工信息如下:n); flag+; break; p=p-next; if(flag=0) printf(未找到該員工信息!n); Prf(head);/刪除函數(shù)/輸入?yún)?shù):n為員工編號(hào)/輸出參數(shù):頭指針struct Stuff *Del(struct Stuff *head,char n10) struct Stuff *p,*pr; int flag; flag=0; p=head,pr=head; if(head=NULL) printf(未找到員工信息!n); else while(strcmp(p-number ,n)&p-next !=NULL) pr=p; p=p-next ; if(!strcmp(p-number ,n) if(p=head) head=p-next ; else pr-next=p-next ; free(p); printf(刪除成功!n); i-; else printf(未找到員工信息!n); Prf(head); return head;/輸出函數(shù)void Prf(struct Stuff *head) struct Stuff *p=head; int