一元多项式相加程序及习题2.doc

一元多项式表示及相加程序如下:/Add Polynomial Pa and Pb#include#include#include#includeStuct Term float coef; int expn; struct Term *next;LinkList;LinkList *CreateList_L(int n) int i; LinkList *p,*L; L=(LinkList *)malloc(sizeof(LinkList); L-next=NULL; for(i=n;i0;-i) p=(LinkList *)malloc(sizeof(LinkList); printf(“input coef=”); scanf(“%d”,&p-coef);printf(“n”); printf(“input expn=”); scanf(“%d”,&p-expn);printf(“n”);p-next=L-next; L-next=p; /end of forReturn L;/end of function CreateListChar cmp(int qa_expn,int qb-expn) if(qa_expn=qb_expn) return=; else if(qa_expnqb_expn)return; else returnnext; qb=pb-next; pre=pa; while(qa&qb) switch(cmp(qa-expn,qb-expn) case next; break;case=: sum=qa-coef+qb-coef; if(sum!=0.0) qa-coef=sum;pre=qa; else pre-next=qa-next;free(qa); qa=pre-next;u=qb;qb=qb-next; free(u); break; case: u=qb-next; qb-next=qa;pre-next=qb; pre=qb; qb=u; break; /end of switch if(!qa)pre-next=qb; free(qb); return pa;end of Addpolyn() function main()LinkList *pa,*pb,*pc,*p;int NodeNum_pa,NodeNum_pb; Printf(“input NodeNum_pa:”); Scanf(“%d”,& NodeNum_pa); printf(“Please input the pa.coef and pa.expn”); pa=CreateList_L(NodeNum_pa); Printf(“input NodeNum_pb:”); Scanf(“%d”,& NodeNum_pb); printf(“Please input the pb.coef and pb.expn”); pb= CreateList_L( NodeNum_pb);Pc=Addpolyn(pa,pb);P=pc;printf(“result:n”);while(p-next) p=p-next; printf(“pc.coef=%d, pc.expn=%dn”, p-coef, p- expn ); /end of while getch();end of main() function运行结果:输入:coef=6expn=5coef=5expn=4coef=4expn=2coef=2expn=1输入:coef=6expn=6coef=5expn=5coef=4expn=4coef=3expn=3coef=2expn=2输出:(pc.coef=2,pc.expn=1)(pc.coef=6,pc.expn=2)(pc.coef=3,pc.expn=3)(pc.coef=9,pc.expn=4)(pc.coef=11,pc.expn=5)(pc.coef=6,pc.expn=6)习题2.1什么情况下用顺序表比链表好？2.2分析单链表、循环链表和双向链表的相同点和不同点，及各自的特点。2.3已知L是无表头结点的单链表，且P结点既不是首结点，也不是尾结点，试从下列提供的语句中选出合适的语句序列。(1) 在P结点后插入S结点：_ _(2) 在P结点前插入S结点：_(3) 在表首插入S结点：_(4) 在表尾插入S结点：_ P-next = S; P-next = P-next-next; P-next = S-next; S-next = P-next; S-next = L; S-next = P; S-next = NULL;