资源描述:
《c 程序开发经典实例之八 编程 mfc c++ 程度设计 教程》由会员上传分享,免费在线阅读,更多相关内容在教育资源-天天文库。
1、C程序开发经典实例之八编程MFCC++程度设计教程【程序71】题目:编写input()和output()函数输入,输出5个学生的数据记录。1.程序分析:2.程序源代码:#defineN5structstudent{ charnum[6]; charname[8]; intscore[4];}stu[N];input(stu)structstudentstu[];{ inti,j; for(i=0;i {printf("pleaseinput%dof%d",i+1,N);printf("num:");scanf("%s",stu[i].num);printf("na
2、me:");scanf("%s",stu[i].name); for(j=0;j<3;j++) { printf("score%d.",j+1); scanf("%d",&stu[i].score[j]); }printf(""); }}print(stu)structstudentstu[];{ inti,j; printf("No.NameSco1Sco2Sco3"); for(i=0;i {printf("%-6s%-10s",stu[i].num,stu[i].name);for(j=0;j<3;j++) printf("%-8d",stu[i
3、].score[j]);printf(""); }}main(){ input(); print();}【程序72】题目:创建一个链表。1.程序分析: 2.程序源代码:/*creatalist*/#include"stdlib.h"#include"stdio.h"structlist{ intdata; structlist*next;};typedefstructlistnode;typedefnode*link;voidmain(){ linkptr,head; intnum,i; ptr=(link)malloc(sizeof(node))
4、; ptr=head; printf("pleaseinput5numbers==>"); for(i=0;i<=4;i++) {scanf("%d",&num);ptr->data=num;ptr->next=(link)malloc(sizeof(node));if(i==4)ptr->next=NULL;elseptr=ptr->next; } ptr=head; while(ptr!=NULL) {printf("Thevalueis==>%d",ptr->data);tr=ptr->next; }}【程序73】题目:反向输出一个链表。 1.程序分析:
5、2.程序源代码:/*reverseoutputalist*/#include"stdlib.h"#include"stdio.h"structlist{ intdata; structlist*next;};typedefstructlistnode;typedefnode*link;voidmain(){ linkptr,head,tail; intnum,i; tail=(link)malloc(sizeof(node)); tail->next=NULL; ptr=tail; printf("pleaseinput5data==>"); for(i=0;i
6、<=4;i++) {scanf("%d",&num);ptr->data=num;head=(link)malloc(sizeof(node));head->next=ptr;ptr=head; } ptr=ptr->next; while(ptr!=NULL) {printf("Thevalueis==>%d",ptr->data);ptr=ptr->next; }}【程序74】题目:连接两个链表。1.程序分析:2.程序源代码:#include"stdlib.h"#include"stdio.h"structlist{ intdata; structlist*nex
7、t;};typedefstructlistnode;typedefnode*link;linkdelete_node(linkpointer,linktmp){ if(tmp==NULL)/*deletefirstnode*/returnpointer->next; else {if(tmp->next->next==NULL)/*deletelastnode*/ tmp->next=NULL;else/*deletetheothernode*/ tmp->next=tmp->next->next;returnpointer;