实验二 线性表的应用

实验二线性表的应用（2学时）一、实验目的：掌握线性表的基本结构和操作方法，培养学生灵活使用结构解决实际问题的能力。二、实验内容： 设计一个100位以内的长整数加减运算的程序。三、实验要求：1，输入输出要求：每四位一组，组间用逗号分隔；2，加和减分别用不同的程序实现3，程序应考虑输入数据的符号四、参考程序/*设计一个100位以内的长整数加减运算的程序。实验要求：1，输入输出要求：每四位一组，组间用逗号分隔；2，程序应考虑输入数据的符号*/#include#include#include#include#include#define LEN sizeof(struct student)struct studentint score;struct student *next;int lenm,lenn,lensum;/m与n的长度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,struct student *n);int compare(struct student *m,struct student *n);struct student *m,*n,*sum;int s1,s2,s3,k;char ch;printf(输入第一个数：n);m=creat(&s1,&lenm);/输入第一个数放在链表m中，s1为其符号printf(n选择运算，输入或:);scanf(%c,&ch);getchar();printf(n输入第二个数：n);n=creat(&s2,&lenn);/输入第一个数放在链表n中，s2为其符号k=compare(m,n);/k=1则mn,k=-1则m0)s3=s1;sum=add(m,n);else if(s10&k=1) s3=1;sum=sub(m,n);/m0,n|n|,m+n=m-|n|if(s10&k=-1)s3=-1;sum=sub(n,m);/m0,n0,m|n|,m+n=-(|n|-m)if(s10&k=1)s3=-1;sum=sub(m,n);/m0,|m|n|,m+n=-(|m|-n)if(s10&k=-1)s3=1;sum=sub(n,m);/m0,|m|n|,m+n=n-|m|if(k=0) s3=0;/endif+if(ch=-)/减法运算if(s1*s20&k=1) s3=1;sum=sub(m,n);/m0,n0,mn,m-n=m-nif(s10&k=-1)s3=-1;sum=sub(n,m);/m0,n0,mn,m-n=-(n-m)if(s10&k=1)s3=-1;sum=sub(m,n);/m0,n|n|,m-n=-(|m|-|n|)if(s10&k=-1)s3=1;sum=sub(n,m);/m0,n0,|m|0) printf(结果为：+);print(sum);if(s3score=0; p1-next=NULL;len=strlen(c);for(;i=0&ciscore=atoi(s);/将s转换成整数 p1-next=p2;/插入到链表头p2=p1;*n=k;return(p1);struct student *add(struct student *m,struct student *n)/加法运算struct student *p1,*p2,*head;/p2指向链表上最后一个结点，p1指向新建立的结点int sumb=0,n1,n2,n3;n1=lenm;n2=lenn;n3=n1n2?n1:n2;p2=p1=(struct student *)malloc(LEN);p1-score=(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=NULL;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;p2-next=p1;p2=p1;m=m-next;while(n!=NULL)p1=(struct student *)malloc(LEN);p1-score=(n-score+sumb)%10000;sumb=(n-score+sumb)/10000;p1-next=NULL;p2-next=p1;p2=p1;n=n-next;lensum=n3;return head;/endaddstruct student *sub(struct student *m,struct student *n)/减法运算struct student *p1,*p2,*head;int sumb=0,n1,n2;n1=lenm;n2=lenn;p2=p1=(struct student *)malloc(LEN);if(m-score=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-score;sumb=0;elsep1-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;return head;/endsubint compare(struct student *m,struct student *n)/比较两数大小int i=0;if(lenmlenn) return 1;if(lenmscoren-score) i=1;if(m-scorescore) i=-1;m=m-next;n=n-ne