試驗(yàn)二線性表的應(yīng)用

1、實(shí)驗(yàn)二 線性表的應(yīng)用( 2 學(xué)時(shí))一、實(shí)驗(yàn)?zāi)康模?掌握線性表的基本結(jié)構(gòu)和操作方法，培養(yǎng)學(xué)生靈活使用結(jié)構(gòu)解決實(shí)際問 題的能力。二、實(shí)驗(yàn)內(nèi)容：設(shè)計(jì)一個(gè) 100 位以內(nèi)的長(zhǎng)整數(shù)加減運(yùn)算的程序。三、實(shí)驗(yàn)要求：1，輸入輸出要求：每四位一組，組間用逗號(hào)分隔；2，加和減分別用不同的程序?qū)崿F(xiàn)3，程序應(yīng)考慮輸入數(shù)據(jù)的符號(hào)四、參考程序/* 設(shè)計(jì)一個(gè) 100 位以內(nèi)的長(zhǎng)整數(shù)加減運(yùn)算的程序。實(shí)驗(yàn)要求：1，輸入輸出要求：每四位一組，組間用逗號(hào)分隔；2，程序應(yīng)考慮輸入數(shù)據(jù)的符號(hào)*/#include<>#include<>#include<>#include<>#includ

2、e<>#define LEN sizeof(struct student)struct studenti nt score;struct student *next;int lenm,lenn,lensum;/m 與 n 的長(zhǎng)度void main()struct student *creat(int *d,int *len);void print(struct student *head);struct student *add(struct student *m,struct student *n);struct student *sub(struct student *m,st

3、ruct student *n);i nt compare(struct student *m,struct student *n);struct student *m,*n,*sum;i nt s1,s2,s3,k;char ch;printf(" 輸入第一個(gè)數(shù)： n");n=creat(&s1,&lenm);輸入第一個(gè)數(shù)放在鏈表m中，si為其符號(hào)printf("n選擇運(yùn)算，輸入或 :");scanf("%c",&ch);getchar();printf("n輸入第二個(gè)數(shù)： n");n=c

4、reat(&s2,&lenn);/ 輸入第一個(gè)數(shù)放在鏈表 n 中， s2 為其符號(hào)k=compare(m,n);/k=1貝U m>n,k=-1 貝U m<n,k=0 貝U m=ni f(ch='+')/ 加法運(yùn)算1if(s1*s2>0)s3=s1;sum=add(m,n);else if(s1>0&&k=1) s3=1;sum=sub(m,n);/m>0,n<0,m>|n|,m+n=m-|n| if(s1>0&&k=-1)s3=-1;sum=sub(n,m);/m>0,n<

5、;0,m<|n|,m+n=-(|n|-m) if(s1<0&&k=1)s3=-1;sum=sub(m,n);/m<0,n>0,|m|>|n|,m+n=-(|m|-n) if(s1<0&&k=-1)s3=1;sum=sub(n,m);/m<0,n>0,|m|<|n|,m+n=n-|m| if(k=0) s3=0; /endif+i f(ch='-')/減法運(yùn)算if(s1*s2<0) s3=s1;sum=add(m,n);elseif(s1>0&&k=1) s3=1;s

6、um=sub(m,n);/m>0,n>0,m>n,m-n=m-n if(s1>0&&k=-1)s3=-1;sum=sub(n,m);/m>0,n>0,m<n,m-n=-(n-m) if(s1<0&&k=1)s3=-1;sum=sub(m,n);/m<0,n<0,|m|>|n|,m-n=-(|m|-|n|) if(s1<0&&k=-1)s3=1;sum=sub(n,m);/m<0,n<0,|m|<|n|,m-n=|n|-|m| if(k=0) s3=0; /e

7、ndif-i f(s3>0) printf("結(jié)果為：+");print(sum);i f(s3<0) printf("結(jié)果為：-");print(sum);if(s3=0) printf("結(jié)果為：0");/endmainstruct student *creat(int *sign,int *n)/輸入數(shù)據(jù)并建立鏈表首結(jié)點(diǎn)存放最低 4位數(shù)據(jù)void print(struct student *head);struct student *p1,*p2;i nt i=0,j,k=0,len;char s5,c130;* s

8、ign=1;gets(c);i f(c0='-')i=1;*sign=-1; p1=p2=(struct student *)malloc(LEN);/ 建立尾結(jié)點(diǎn) p1->score=0;p1->next=NULL;l en=strlen(c);f or(;i<len;i+)j=0;while(ci>='0'&&ci<='9')/ 取出逗號(hào)之間的每一組數(shù)存放到字符數(shù)組 s 中sj+=ci+;k+; sj='0' p1=(struct student *)malloc(LEN);p1-

9、>score=atoi(s);/ 將 s 轉(zhuǎn)換成整數(shù) p1->next=p2;/ 插入到鏈表頭 p2=p1;*n=k;return(p1);加法運(yùn)算p1 指向新建立的結(jié)點(diǎn)struct student *add(struct student *m,struct student *n)/struct student *p1,*p2,*head;/p2 指向鏈表上最后一個(gè)結(jié)點(diǎn)， i nt sumb=0,n1,n2,n3;n1=lenm;n2=lenn; n3=n1>n2n1:n2;p2=p1=(struct student *)malloc(LEN); p1->score=(

10、m->score+n->score)%10000; sumb=(m->score+n->score+sumb)/10000;p2->next=NULL;head=p2;m=m->next;n=n->next; while(m!=NULL&&n!=NULL) p1=(struct student *)malloc(LEN); p1->score=(m->score+n->score+sumb)%10000; sumb=(m->score+n->score+sumb)/10000;p1->next=NUL

11、L; p2->next=p1;p2=p1; m=m->next; n=n->next; while(m!=NULL) p1=(struct student *)malloc(LEN); p1->score=(m->score+sumb)%10000; sumb=(m->score+sumb)/10000;p1->next=NULL;3p2->next=p1; p2=p1;m=m->next;while(n!=NULL) p1=(struct student *)malloc(LEN); p1->score=(n->score+s

12、umb)%10000; sumb=(n->score+sumb)/10000;p1->next=NULL; p2->next=p1;p2=p1; n=n->next;l ensum=n3;r eturn head;/endadd減法運(yùn)算struct student *sub(struct student *m,struct student *n)/struct student *p1,*p2,*head;i nt sumb=0,n1,n2; n1=lenm;n2=lenn;p2=p1=(struct student *)malloc(LEN);i f(m->sco

13、re>=n->score)p1->score=m->score+sumb-n->score; elsep1->score=m->score-n->score+10000;sumb=-1; p1->next=NULL;m=m->next;n=n->next;head=p2;while(n) p1=(struct student *)malloc(LEN);p1->next=NULL; if(m->score+sumb>=n->score) p1->score=m->score+sumb-n-&g

14、t;score; sumb=0;else p1->score=m->score+sumb-n->score+10000; sumb=-1; p2->next=p1;p2=p1;m=m->next;n=n->next;while(m)p1=(struct student *)malloc(LEN); p1->next=NULL;p1->score=m->score+sumb; sumb=0;p2->next=p1; p2=p1;m=m->next;lensum=n1;r eturn head;/endsub比較兩數(shù)大小int compare(struct student *m,struct student *n)/i nt i=0;i f(lenm>lenn) return 1;i f(lenm<lenn) return -1;while(m&&n)if(m->score>n->score) i=1;if(m->score<