c++第六章.doc

1#include using namespace std;typedef struct studentint no;char name20;double score3;STU;void input(STU *p,int n)cout请输入如下学生信息endl;cout学号 姓名 3门功课的成绩n;for(int i=0;ip-no;cinp-name;cinp-score0p-score1p-score2;p+;void print(STU *p,int n)STU *q;int i,j=0;double average,sum,max,temp,c3,all20,aver20;for(i=0;i3;i+)sum=0;max=0;cout第i门课的平均分是:;for(q=p;qscorei;if(maxscorei)max=q-scorei;average=sum/n;coutaverageendl;ci=max; cout三门功课分别最高的是:endl;for(i=0;i3;i+)for(q=p;qscorei=ci)coutno ;coutname ;coutscore0 ;coutscore1 ;coutscore2 ;coutendl;coutendl;for(q=p;qp+n;q+)sum=0;for(i=0;iscorei;allj=sum;averj=sum/3;j+;for(i=1;in;i+)for(j=0;jallj+1)temp=allj;allj=allj+1;allj+1=temp;cout排序后的总分情况:;for(i=0;in;i+)coutalli ;coutendl;cout平均分高于80分的同学的信息是:endl;for(i=0;i80)coutno ;coutname ;coutscore0 ;coutscore1 ;coutscore2 ;coutendl;int main()STU stu3;input(stu,3);print(stu,3);return 0;2#includeusing namespace std;typedef struct studentint id;char name20;char address 50;char no10;char tel10;char mail20;STU;void input(STU *p, int n)STU *q;cout请按如下顺序输入信息endl;cout学号 姓名 家庭住址 电话号码 手机号码 E-mail地址endl; for(q=p;qq-id;cinq-name;cinq-address;cinq-no;cinq-tel;cinq-mail;void print (STU *p,int n)STU *q;for(q=p;qp+n;q+)coutid ;coutname ;coutaddress ;coutno ;couttel ;coutmail;coutendl;int main()STU a50;input(a,50);print(a,20);return 0;3强哥例题4#include #include using namespace std;typedef struct nodeint data;node *next;NODE;NODE *initlist()NODE *head;head=(NODE*)malloc(sizeof(NODE);head-next=NULL;return head;NODE *creat() NODE *p1,*p2,*head;int a;couta;while(a!=-1) p1=(NODE*)malloc(sizeof(NODE); p1-data=a; p2-next=p1; p2=p1; / couta; p2-next=NULL;return (head);void print (NODE *head)NODE *p;p=head-next;if(p!=NULL)coutoutput list:;while(p!=NULL)coutdatanext;coutnext; k=NULL;while(p!=NULL)q=p-next;p-next=k;k=p;p=q;head-next=k;int main ()NODE *head=NULL;head=creat();/print(L);reverse(head);print(head);return 0;5#include #include using namespace std;typedef struct nodeint data;node *next;NODE;NODE *initlist()NODE *head;head=(NODE*)malloc(sizeof(NODE);head-next=NULL;return head;NODE *creat() NODE *p1,*p2,*head;int a;couta;while(a!=-1) p1=(NODE*)malloc(sizeof(NODE); p1-data=a; p2-next=p1; p2=p1; / couta; p2-next=NULL;return (head);void print (NODE *head)NODE *p;p=head-next;if(p!=NULL)coutoutput list:;while(p!=NULL)coutdatanext;coutnext-next;NODE *k;head-next-next=NULL;while(q!=NULL)while(m-next!=NULL & q-datam-next-data)m=m-next; k=q-next;q-next=m-next;m-next=q;q=k;/*void reserve (NODE *head)NODE *p,*q;int temp;int m=sizeof(head)-1;for(int i=1;inext;q=p-next;while(q!=NULL)if(p-dataq-data)temp=p-data;p-data=q-data;q-data=temp;p=q;q=q-next;*/int main()NODE *p;p=creat();reserve(p);print(p);return 0;6#include #include using namespace std;typedef struct nodeint data;node *next;NODE;NODE *initlist()NODE *head;head=(NODE*)malloc(sizeof(NODE);head-next=NULL;return head;NODE *creat() NODE *p1,*p2,*head;int a;couta;while(a!=-1) p1=(NODE*)malloc(sizeof(NODE); p1-data=a; p2-next=p1; p2=p1; / couta; p2-next=NULL;return (head);void print (NODE *head)NODE *p;p=head-next;if(p!=NULL)coutoutput list:;while(p!=NULL)coutdatanext;coutnext;while(q!=NULL)k=q-next;p=headA;while(p-next!=NULL&p-next-datadata)p=p-next;q-next=p-next;p-next=q;q=k;return headA;int main()NODE *p,*q;cout请有序输入链表endl;p=creat();q=creat();print(p);print(q);p=merge(p,q);print(p);return 0;7#include #include using namespace std;typedef struct nodeint data;node *next;NODE;NODE *initlist()NODE *head;head=(NODE*)malloc(sizeof(NODE);head-next=NULL;return head;NODE *creat() NODE *p1,*p2,*head;int a;couta;while(a!=-1) p1=(NODE*)malloc(sizeof(NODE); p1-data=a; p2-next=p1; p2=p1; /couta; p2-next=NULL;return (head);bool search(NODE *L1,NODE *L2)int flag=0;NODE *p,*q;q=L2-next;while(q!=NULL)p=L1-next;while(p!=NULL)if(q-data=p-data)flag=1;break;p=p-next;if(flag=0)break;elseq=q-next;if(flag)return true;return false;void print (NODE *