c程序設計第四版(譚浩強)第九章答案

#include<stdio.h>#include<stdlib.h>/*intdays(inty,intm,intd)//計算天數(shù){ intdays=0,i; inta[12]={31,28,31,30,31,30,31,31,30,31,30,31}; if(y%4==0&&y%100!=0||y%400==0)//判斷是否為閏年 a[1]+=1; if(m==1) returndays; else { for(i=0;i<m-1;i++) days+=a[i]; days+=d; returndays; }}structdate{ intyear; intmonth; intday; intdays;}a;intmain(){ printf("enterdate:"); scanf("%d%d%d",&a.year,&a.month,&a.day); a.days=days(a.year,a.month,a.day); printf("%d年%d月%d日是該年的第%d天\n",a.year,a.month,a.day,a.days);}*//*#defineN10//第3、4題時N為5，第5題時N為10structstudent{ intnum; charname[20]; floatscore[3]; floatave;//第3、4、5題共用一個結(jié)構(gòu)體類型}stu[N];*//*voidprint(structstudenta[]){ inti; printf("學號姓名\t三門課成績\n"); for(i=0;i<N;i++) printf("%ld%s\t%-5.1f%-5.1f%-5.1f\n",a[i].num,a[i].name,a[i].score[0],a[i].score[1],a[i].score[2]);}intmain(){ inti; printf("請輸入%d個學生的信息:學號、姓名、三門課成績:\n",N); for(i=0;i<N;i++) scanf("%d%s%f%f%f",&stu[i].num,&stu[i].name,&stu[i].score[0],&stu[i].score[1],&stu[i].score[2]); print(stu);}*//*voidprint(structstudenta[]){ inti; printf("學號姓名\t三門課成績\n"); for(i=0;i<N;i++) printf("%ld%s\t%-5.1f%-5.1f%-5.1f\n",a[i].num,a[i].name,a[i].score[0],a[i].score[1],a[i].score[2]);}voidinput(structstudenta[])//在上一題的基礎上編寫input函數(shù){ inti; printf("請輸入%d個學生的信息:學號、姓名、三門課成績:\n",N); for(i=0;i<N;i++) scanf("%d%s%f%f%f",&stu[i].num,&stu[i].name,&stu[i].score[0],&stu[i].score[1],&stu[i].score[2]);}intmain(){ input(stu); print(stu);{ structstudent*head; structstudent*p1,*p2; n=0; p1=p2=malloc(L); scanf("%ld,%f",&p1->num,&p1->score); head=NULL; while(p1->num!=0) { n+=1; if(n==1)head=p1; elsep2->next=p1; p2=p1; p1=malloc(L); scanf("%ld,%f",&p1->num,&p1->score); } p2->next=NULL; returnhead;}voidprint(structstudent*head)//輸出鏈表的函數(shù){ structstudent*p=head; printf("\nnow,theserecordsare:\n"); while(p!=NULL) { printf("%ld%5.1f\n",p->num,p->score); p=p->next; }}structstudent*del1(structstudent*head,longnum)//刪除指定節(jié)點的函數(shù)，方法一，指定刪除節(jié)點的數(shù)據(jù){ structstudent*p1,*p2; p1=head; if(p1->num==num) returnhead=p1->next; else { while(p1->num!=num) { p2=p1; p1=p1->next; } p2->next=p1->next; p1->next=NULL; returnhead; }}structstudent*del2(structstudent*head,intn)//方法二，指定刪除節(jié)點序號{ structstudent*p1,*p2; inti=1; p1=head; if(i==n) returnhead=p1->next; else { while(i++<n) { p2=p1; p1=p1->next; } p2->next=p1->next; p1->next=NULL; returnhead; }}intmain(){ structstudent*head; longnum;//intn; head=creat(); print(head); printf("\n輸入要刪除學生的學號:");//printf("\n輸入要刪除節(jié)點序號:"); scanf("%ld",&num);//scanf("%d",&n); head=del1(head,num);//head=del2(head,n); print(head);}*//*#defineLsizeof(structstudent)structstudent{ longnum; floatscore; structstudent*next;};intn;structstudent*creat(void)//生成單向動態(tài)鏈表的函數(shù){ structstudent*head; structstudent*p1,*p2; n=0; p1=p2=malloc(L); scanf("%ld,%f",&p1->num,&p1->score); head=NULL; while(p1->num!=0) { n+=1; if(n==1)head=p1; elsep2->next=p1; p2=p1; p1=malloc(L); scanf("%ld,%f",&p1->num,&p1->score); } p2->next=NULL; returnhead;}voidprint(structstudent*head)//輸出鏈表的函數(shù){ structstudent*p=head; printf("\nnow,theserecordsare:\n"); while(p!=NULL) { printf("%ld%5.1f\n",p->num,p->score); p=p->next; }}structstudent*del1(structstudent*head,longnum)//刪除指定節(jié)點的函數(shù)，num為指定刪除節(jié)點的數(shù)據(jù){ structstudent*p1,*p2; p1=head; if(p1->num==num) returnhead=p1->next; else { while(p1->num!=num) { p2=p1; p1=p1->next; } p2->next=p1->next; p1->next=NULL; returnhead; }}structstudent*insert(structstudent*head,structstudent*p,intn)//插入節(jié)點的函數(shù),n為新節(jié)點序號{ structstudent*p1,*p2; inti=1; p1=head; if(i==n) { p->next=p1; head=p; } else { while(i++<n) { p2=p1; p1=p1->next; } p2->next=p; p->next=p1; } returnhead;}intmain(){ structstudent*head,*p; intn; longnum; head=creat(); print(head); printf("\n輸入要刪除學生的學號:"); scanf("%d",&num); head=del(head,num); print(head); p=malloc(L);//為插入的新節(jié)點開辟單元，否則p的值不確定 printf("\n輸入要添加學生的學號,成績,序號:"); scanf("%ld,%f,%d",&p->num,&p->score,&n); head=insert(head,p,n); print(head);}*//*#defineLsizeof(structstudent)structstudent{ intnum; floatscore; structstudent*next;};intn;structstudent*creat(void)//生成單向動態(tài)鏈表的函數(shù){ structstudent*head; structstudent*p1,*p2; n=0; p1=p2=malloc(L); scanf("%d%f",&p1->num,&p1->score); head=NULL; while(p1->num!=0) { n+=1; if(n==1)head=p1; elsep2->next=p1; p2=p1; p1=malloc(L); scanf("%d%f",&p1->num,&p1->score); } p2->next=NULL; returnhead;}voidprint(structstudent*head)//輸出鏈表的函數(shù){ structstudent*p=head; printf("\nnow,theserecordsare:\n"); while(p!=NULL) { printf("%d%5.1f\n",p->num,p->score); p=p->next; }}structstudent*sort(structstudent*head)//建立鏈表排序函數(shù){ structstudent*p1,*p2; intt; floats; p1=head; p2=p1->next; while(p1&&p2)//不能寫為p1，否則當p1指向最后一個結(jié)點時，最后一句循環(huán)語句出問題 { while(p2) { if(p1->num>p2->num) { t=p1->num; s=p1->score; p1->num=p2->num; p1->score=p2->score; p2->num=t; p2->score=s; p2=p2->next; } else//不能省略else語句，否則遇到p1->num<p2->num時無限循環(huán) p2=p2->next; } p1=p1->next; p2=p1->next; } returnhead;}structstudent*cat(structstudent*head1,structstudent*head2)//建立鏈表合并函數(shù){ structstudent*p,*t; p=head1; while(p) { t=p;//循環(huán)結(jié)束時t將指向a鏈表的最后一個指針 p=p->next; } t->next=head2; returnhead1;}intmain(){ structstudent*a,*b; printf("輸入鏈表a:\n"); a=creat(); printf("輸入鏈表b:\n"); b=creat(); print(sort(cat(a,b)));}*//*測試數(shù)據(jù)100188910016641001481100129400100176710015681001376100118500*//*#defineLsizeof(structstudent)structstudent{ longnum; charname[20]; structstudent*next;};intn;structstudent*creat(void)//生成單向動態(tài)鏈表的函數(shù){ structstudent*head; structstudent*p1,*p2; n=0; p1=p2=malloc(L); scanf("%ld%s",&p1->num,p1->name); head=NULL; while(p1->num!=0) { n+=1; if(n==1)head=p1; elsep2->next=p1; p2=p1; p1=malloc(L); scanf("%ld%s",&p1->num,p1->name); } p2->next=NULL; returnhead;}voidprint(structstudent*head)//輸出鏈表的函數(shù){ structstudent*p=head; printf("\n現(xiàn)在鏈表a為:\n"); while(p!=NULL) { printf("%ld%s\n",p->num,p->name); p=p->next; }}structstudent*delsame(structstudent*a,structstudent*b)//從a中刪去與b相同學號的節(jié)點{ structstudent*p1,*p2,*p3; longnum; ints,k=0; p3=p1=a;p2=b; while(p1) { s=0; num=p1->num; while(p2) { if(p2->num!=num) p2=p2->next; else { s=1; break; } } if(s==1) p3->next=p1->next;//若a最后一個相同，p3的指針數(shù)據(jù)為null else { p3=p1;//每找到一個與b不相等的指針時，p3指向它 k+=1;//每找到一個與b不相等的指針時，k累加1 if(k==1)//找到第一個與b不相等的指針時，將頭指針賦值給a a=p1; } p1=p1->next;//p1指向下一個指針 p2=b;//p2重新指向鏈表b開頭 } if(k==0)//k=0表明a,b鏈表相同，返回null returna=NULL; else returna;}intmain(){ structstudent*a,*b; printf("輸入鏈表a:\n"); a=creat(); printf("輸入鏈表b:\n"); b=creat(); a=delsame(a,b); print(a);}*//*#defineLsizeof(structinf)structinf{ longnum; intage; charname[20]; charsex; structinf*next;};intn;structinf*creat(void)//生成單向動態(tài)鏈表的函數(shù){ structinf*head; structinf*p1,*p2; n=0; p1=p2=malloc(L); scanf("%ld%s%c%d",&p1->num,p1->name,&p1->sex,&p1->age); head=NULL; while(p1->num!=0) { n+=1; if(n==1)head=p1; elsep2->next=p1; p2=p1; p1=malloc(L); scanf("%ld%s%c%d",&p1->num,p1->name,&p1->sex,&p1->age)