欢迎来到天天文库
浏览记录
ID:42077753
大小:91.50 KB
页数:8页
时间:2019-09-07
《经典c程序阅读(8)》由会员上传分享,免费在线阅读,更多相关内容在工程资料-天天文库。
1、经典C程序100例=71—80【程序71】题目:编写input()和output()函数输入,输出5个学生的数据记录。1•程序分析:2.程序源代码:#defineN5structstudent{charnum[6];charname[8];intscore[4];}stu[N];input(stu)structstudentstu[];{inti,j;for(i=0;i2、.num);printf(z,name:“);scanfstu[i].name);for(j=0;j<3;j++){printf(z/score%d.:j+1);scanf(”%d",&stu[i].score[j]);}printf("");}}print(stu)structstudentstu[];{inti,j;printf(,zNo.NameScolSco2Sco3");for(i=0;i3、(j=0;j<3;j++)printf(z,%-8dz/,stu[订.score[j]);printf(,z");}}main(){input();print();【程序72】题目:创建一个链表。1.程序分析:2.程序源代码:/*creatalist*/Sinclude"stdlib.h"#include"stdio.h"structlist{intdata;structlist*next;};typedefstructlistnode;typedefnode*link;voidmain(){linkptr,h4、ead;intnum,i;ptr=(1ink)malloc(sizeof(node));ptr=head;printf(,zpleaseinput5numbers==>");for(i=0;i<=4;i++){scanf&num);ptr->data=num;ptr-〉next二(1ink)malloc(sizeof(node));iF(i=4)ptr->next二NULL;elseptr=ptr->ncxt;}ptr=head;while(ptr!=NULL){printf(z,Thevalueis=〉%d5、n",ptr-〉data);ptr=ptr->ncxt;【程序73]题目:反向输出一个链表。1.程序分析:2.程序源代码:/^reverseoutputalist*/^include"stdlib.h"Sinclude"stdio.h"structlist{intdata;structlist*next;};typedefstructlistnode;typedefnode*link;voidmain(){linkptr,head,tail;intnum,i;tail=(link)malloc(sizeof(nod6、e));tail->next=NULL:ptr=tai1;printf(,zpleaseinput5data==>,z);for(i二0;i〈二4;i++){scanf(z/%d,z,&num);ptr->data二num;head二(1ink)malloc(sizeof(node));head->next=ptr;ptr=head;}ptr=ptr->next;while(ptr!=NULL){printf(/zThevalueis=>%d",ptr->data);ptr=ptr->next;}}【程7、序74】题目:连接两个链农。1.程序分析:2.程序源代码:#include"stdlib.h"^include"stdio.h"structlist{intdata;structlist*next;};typedefstructlistnode;typedefnode*link;linkdelete_node(linkpointer,linktmp){if(tmp==NULL)/^deletef让stnode*/returnpointer->next;else{if(tmp-〉next-〉next二二NULL)"d8、eletelastnode*/tmp->next=NULL;else/^deletetheothernode*/tmp->next=tmp->next->next;returnpointer;}}voidselectionsort(1inkpointer,intnum){linktmp,btmp;inti,min;for(i=0;i
2、.num);printf(z,name:“);scanfstu[i].name);for(j=0;j<3;j++){printf(z/score%d.:j+1);scanf(”%d",&stu[i].score[j]);}printf("");}}print(stu)structstudentstu[];{inti,j;printf(,zNo.NameScolSco2Sco3");for(i=0;i3、(j=0;j<3;j++)printf(z,%-8dz/,stu[订.score[j]);printf(,z");}}main(){input();print();【程序72】题目:创建一个链表。1.程序分析:2.程序源代码:/*creatalist*/Sinclude"stdlib.h"#include"stdio.h"structlist{intdata;structlist*next;};typedefstructlistnode;typedefnode*link;voidmain(){linkptr,h4、ead;intnum,i;ptr=(1ink)malloc(sizeof(node));ptr=head;printf(,zpleaseinput5numbers==>");for(i=0;i<=4;i++){scanf&num);ptr->data=num;ptr-〉next二(1ink)malloc(sizeof(node));iF(i=4)ptr->next二NULL;elseptr=ptr->ncxt;}ptr=head;while(ptr!=NULL){printf(z,Thevalueis=〉%d5、n",ptr-〉data);ptr=ptr->ncxt;【程序73]题目:反向输出一个链表。1.程序分析:2.程序源代码:/^reverseoutputalist*/^include"stdlib.h"Sinclude"stdio.h"structlist{intdata;structlist*next;};typedefstructlistnode;typedefnode*link;voidmain(){linkptr,head,tail;intnum,i;tail=(link)malloc(sizeof(nod6、e));tail->next=NULL:ptr=tai1;printf(,zpleaseinput5data==>,z);for(i二0;i〈二4;i++){scanf(z/%d,z,&num);ptr->data二num;head二(1ink)malloc(sizeof(node));head->next=ptr;ptr=head;}ptr=ptr->next;while(ptr!=NULL){printf(/zThevalueis=>%d",ptr->data);ptr=ptr->next;}}【程7、序74】题目:连接两个链农。1.程序分析:2.程序源代码:#include"stdlib.h"^include"stdio.h"structlist{intdata;structlist*next;};typedefstructlistnode;typedefnode*link;linkdelete_node(linkpointer,linktmp){if(tmp==NULL)/^deletef让stnode*/returnpointer->next;else{if(tmp-〉next-〉next二二NULL)"d8、eletelastnode*/tmp->next=NULL;else/^deletetheothernode*/tmp->next=tmp->next->next;returnpointer;}}voidselectionsort(1inkpointer,intnum){linktmp,btmp;inti,min;for(i=0;i
3、(j=0;j<3;j++)printf(z,%-8dz/,stu[订.score[j]);printf(,z");}}main(){input();print();【程序72】题目:创建一个链表。1.程序分析:2.程序源代码:/*creatalist*/Sinclude"stdlib.h"#include"stdio.h"structlist{intdata;structlist*next;};typedefstructlistnode;typedefnode*link;voidmain(){linkptr,h
4、ead;intnum,i;ptr=(1ink)malloc(sizeof(node));ptr=head;printf(,zpleaseinput5numbers==>");for(i=0;i<=4;i++){scanf&num);ptr->data=num;ptr-〉next二(1ink)malloc(sizeof(node));iF(i=4)ptr->next二NULL;elseptr=ptr->ncxt;}ptr=head;while(ptr!=NULL){printf(z,Thevalueis=〉%d
5、n",ptr-〉data);ptr=ptr->ncxt;【程序73]题目:反向输出一个链表。1.程序分析:2.程序源代码:/^reverseoutputalist*/^include"stdlib.h"Sinclude"stdio.h"structlist{intdata;structlist*next;};typedefstructlistnode;typedefnode*link;voidmain(){linkptr,head,tail;intnum,i;tail=(link)malloc(sizeof(nod
6、e));tail->next=NULL:ptr=tai1;printf(,zpleaseinput5data==>,z);for(i二0;i〈二4;i++){scanf(z/%d,z,&num);ptr->data二num;head二(1ink)malloc(sizeof(node));head->next=ptr;ptr=head;}ptr=ptr->next;while(ptr!=NULL){printf(/zThevalueis=>%d",ptr->data);ptr=ptr->next;}}【程
7、序74】题目:连接两个链农。1.程序分析:2.程序源代码:#include"stdlib.h"^include"stdio.h"structlist{intdata;structlist*next;};typedefstructlistnode;typedefnode*link;linkdelete_node(linkpointer,linktmp){if(tmp==NULL)/^deletef让stnode*/returnpointer->next;else{if(tmp-〉next-〉next二二NULL)"d
8、eletelastnode*/tmp->next=NULL;else/^deletetheothernode*/tmp->next=tmp->next->next;returnpointer;}}voidselectionsort(1inkpointer,intnum){linktmp,btmp;inti,min;for(i=0;i
此文档下载收益归作者所有