1、數據結構實驗報告 一元稀疏多項式計算器 安子燁 PB12203079實驗目的實現一元多項式的簡單運算功能，掌握線性表的知識，提高編程能力。 功能清單1. 一元多項式創建2. 顯示一元多項式3. 復制一元多項式4. 多項式加法5. 多項式減法6. 修改一元多項式7. 刪除一元多項式8. 銷毀記錄實驗設計該多項式計算器以菜單驅動的形式實現上述各運算功能。最多可支持十條記錄，分別用指針數組引導存儲于十個不同的位置。以下為程序的部分源代碼。#include<stdio.h>#include<math.h>#include<stdlib.h>typedef struc

2、t LinkListdouble coef;int expn;LinkList *next;LNode;void CreatPolyn(LinkList *h)/創建多項式LinkList *q=NULL, *w=NULL, *p=NULL;double m=0; int n=0;(*h)=(LinkList *)malloc(sizeof(LinkList);(*h)->coef=0; (*h)->expn=0; (*h)->next=NULL; printf("請輸入X的系數和指數,當系數為零時結束創建n"); scanf("%lf%d&qu

3、ot;,&m,&n);while(m!=0)q=(LinkList *)malloc(sizeof(LinkList);q->coef=m; q->expn=n; q->next=NULL;if(*h)->next=NULL)if(q->expn=(*h)->expn) (*h)->coef+=q->coef; else if(*h)->expn>q->expn) q->next=(*h); *h=q; else (*h)->next=q;elsefor(w=(*h);w->next!=NULL

4、;w=w->next) if(q->expn=w->expn) w->coef+=q->coef; break; else if(w->expn>q->expn)&&(w=*h) q->next=(*h); (*h)=q; break; else if(w->expn<q->expn)&&(w->next->expn>q->expn)q->next=w->next; w->next=q; break;if(w->next=NULL) if(w-

5、>expn=q->expn) w->coef+=q->coef;else if(w->expn<q->expn) w->next=q; printf("請輸入X的系數和指數,當系數為零時結束創建n"); scanf("%lf%d",&m,&n);void PrintPolyn(LinkList *p, int i)/打印多項式printf("第%d個多項式是:",i);while(p!=NULL)if(p->coef)>0) printf("+%lf

6、*X%d",p->coef,p->expn);else if(p->coef)<0) printf("%lf*X%d",p->coef,p->expn); p=p->next; printf("n");void CopyPolyn(LinkList *M, LinkList *N)/多項式復制 LinkList *p=NULL, *q=NULL, *w=NULL; (*N)=(LinkList *)malloc(sizeof(LinkList); (*N)->coef=(*M)->coef;

7、 (*N)->expn=(*M)->expn; (*N)->next=NULL; for(w=(*N),p=(*M)->next;p!=NULL;p=p->next) q=(LinkList *)malloc(sizeof(LinkList); q->coef=p->coef; q->expn=p->expn; q->next=p->next; w->next=q; w=w->next; void AddPolyn(LinkList *M, LinkList *N, LinkList *X)/多項式加法LinkLis

8、t *p=NULL, *q=NULL, *w=NULL, *z=NULL;(*X)=(LinkList *)malloc(sizeof(LinkList);(*X)->coef=0; (*X)->expn=0; (*X)->next=NULL;for(p=M,q=N,w=(*X);(p!=NULL)&&(q!=NULL);)z=(LinkList *)malloc(sizeof(LinkList);if(p->expn<q->expn)z->coef=p->coef; z->expn=p->expn; z->ne

9、xt=NULL;p=p->next; w->next=z; w=w->next;else if(p->expn>q->expn)z->coef=q->coef; z->expn=q->expn; z->next=NULL;q=q->next; w->next=z; w=w->next;else if(p->expn=q->expn)z->coef=p->coef+q->coef; z->expn=p->expn; z->next=NULL;p=p->next

10、; q=q->next; w->next=z; w=w->next;if(p=NULL)for(;q!=NULL;)z=(LinkList *)malloc(sizeof(LinkList); z->coef=q->coef; z->expn=q->expn; z->next=NULL; q=q->next; w->next=z; w=w->next;else if(q=NULL)for(;p!=NULL;)z=(LinkList *)malloc(sizeof(LinkList);z->coef=p->coef;

11、z->expn=p->expn; z->next=NULL;p=p->next; w->next=z; w=w->next;for(w=(*X);w!=NULL;w=w->next)printf("%lf %dn",w->coef,w->expn);void SubtractPolyn(LinkList *M, LinkList *N, LinkList *X)/多項式減法LinkList *p=NULL, *q=NULL, *w=NULL, *z=NULL;(*X)=(LinkList *)malloc(sizeof(

12、LinkList);(*X)->coef=0; (*X)->expn=0; (*X)->next=NULL;for(p=M,q=N,w=(*X);(p!=NULL)&&(q!=NULL);)z=(LinkList *)malloc(sizeof(LinkList);if(p->expn<q->expn)z->coef=p->coef; z->expn=p->expn; z->next=NULL;p=p->next; w->next=z; w=w->next;else if(p->expn&

13、gt;q->expn)z->coef=-q->coef; z->expn=q->expn; z->next=NULL;q=q->next; w->next=z; w=w->next;else if(p->expn=q->expn)z->coef=p->coef-q->coef; z->expn=p->expn; z->next=NULL;p=p->next; q=q->next; w->next=z; w=w->next;if(p=NULL)for(;q!=NULL;)

14、z=(LinkList *)malloc(sizeof(LinkList); z->coef=-q->coef; z->expn=q->expn; z->next=NULL; q=q->next; w->next=z; w=w->next;else if(q=NULL)for(;p!=NULL;)z=(LinkList *)malloc(sizeof(LinkList);z->coef=p->coef; z->expn=p->expn; z->next=NULL;p=p->next; w->next=z;

15、 w=w->next;/*for(w=(*X);w!=NULL;w=w->next)printf("%lf %dn",w->coef,w->expn);*/void ValuePolyn(LinkList *h, double x)/多項式求值double sum=0, a=0;while(h!=NULL)a=pow(x,h->expn);sum=sum+(h->coef)*a;h=h->next;printf("所求多項式的值為%lfn",sum);void DeletePolyn(LinkList *h)Li

16、nkList *p=(*h)->next; (*h)=NULL;while(p!=NULL)free(*h);(*h)=p;p=p->next;void RevisePolyn(LinkList *h, int i)int n=0;int choose=0;double m=0;LinkList *q=NULL, *w=NULL;PrintPolyn(*h),i);printf("請輸入你想執行的操作代號（添加：1；修改：2；刪除：3）n");scanf("%d",&choose);switch(choose) case 1: pri

17、ntf("輸入你想要添加項的系數和次數n"); scanf("%lf%d",&m,&n); q=(LinkList *)malloc(sizeof(LinkList); q->coef=m; q->expn=n; q->next=NULL; for(w=(*h);w->next!=NULL;w=w->next) if(w->expn>q->expn)&&(w=*h) q->next=(*h); (*h)=q; break; else if(w->expn<q

18、->expn)&&(w->next->expn>q->expn) q->next=w->next; w->next=q; break; if(w->expn<n) w->next=q; break; case 2: printf("輸入你想要修改項的系數和次數n"); scanf("%lf%d",&m,&n); for(w=(*h);w!=NULL;w=w->next) if(w->expn=n) w->coef=m; printf(&qu

19、ot;未找到該項。n"); break; case 3: printf("輸入你想要刪除項的次數n"); scanf("%d",&n); for(w=(*h);w!=NULL;w=w->next) if(w->expn=n) w->coef=0; break; default: printf("輸入錯誤，修改失敗n"); void main()/*int i=n=N1=N2=0;*/LinkList *p10=0,0,0,0,0,0,0,0,0,0;int i=0, j=0, k=0;int cho

20、ose=0;double m=0, x=0; printf("請輸入n");printf("菜單：n");printf("1 創建多項式n");printf("2 顯示多項式n");printf("3 復制多項式n");printf("4 多項式求和n");printf("5 多項式求差n"); printf("6 多項式求值n");printf("7 銷毀多項式n");printf("8 清空所有多項式n

21、");printf("9 修改（添加、刪除、更改系數、指數）n");printf("0 退出計算器n"); start:printf("請輸入序號進行功能選擇n"); scanf("%d",&choose);while(choose!=0)switch(choose) case 1: printf("請輸入你想創建多項式的位置(09)n"); scanf("%d",&i); CreatPolyn(&pi); goto start; case

22、2: for(i=0;i<=9;i+) PrintPolyn(pi,i); goto start; case 3: printf("請輸入要復制的多項式的號碼和目的地號碼n"); scanf("%d%d",&i,&j); CopyPolyn(&pi,&pj); goto start; case 4: printf("請輸入要求和的兩個多項式的號碼以及存放結果的號碼n"); scanf("%d%d%d",&i,&j,&k); AddPolyn(pi,pj,

23、&pk); goto start; case 5: printf("請輸入要求差的兩個多項式的號碼以及存放結果的號碼n"); scanf("%d%d%d",&i,&j,&k); SubtractPolyn(pi,pj,&pk); goto start; case 6: printf("請輸入你想求值的多項式的位置(09)n"); scanf("%d",&i); printf("請輸入你想要的X值n"); scanf("%lf",&x); ValuePolyn(pi,x); goto start; case 7: printf("請輸入你想銷毀的多項式的位置(09)n"); scanf("%d",&i); DeletePolyn(&pi); goto start; case 8: for(i=0;i<=9;i+) DeletePolyn(&pi); goto start; case 9: printf("請輸入你想要修改的多