资源描述：
《一元多项式相加程序及习题2》由会员上传分享，免费在线阅读，更多相关内容在教育资源-天天文库。
1、一元多项式表示及相加程序如下://AddPolynomialPaandPb#include#include#include#includeStuctTerm{floatcoef;intexpn;structTerm*next;}LinkList;LinkList*CreateList_L(intn){inti;LinkList*p,*L;L=(LinkList*)malloc(sizeof(LinkList));L->next=NULL;for(i
2、=n;i>0;--i){p=(LinkList*)malloc(sizeof(LinkList));printf(“inputcoef=”);scanf(“%d”,&p->coef);printf(“”);printf(“inputexpn=”);scanf(“%d”,&p->expn);printf(“”);p->next=L->next;L->next=p;}//endofforReturnL;}//endoffunctionCreateListCharcmp(intqa_expn,intqb->expn){i
3、f(qa_expn==qb_expn)return’=‘;elseif(qa_expn>qb_expn)return’>’;elsereturn’<‘;}//endofcmp()functionLinkList*Addpolyn(LinkList*pa,LinkList*pb){LinkList*qa,*qb,*pre,*u;floatsum;qa=pa->next;qb=pb->next;pre=pa;while(qa&&qb)switch(cmp(qa->expn,qb->expn)){case‘<‘:pre=qa;q
4、a=qa->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;}//endofswitchif(!qa)pre->next=qb;free(qb);
5、returnpa;}endofAddpolyn()functionmain(){LinkList*pa,*pb,*pc,*p;intNodeNum_pa,NodeNum_pb;Printf(“inputNodeNum_pa:”);Scanf(“%d”,&NodeNum_pa);printf(“Pleaseinputthepa.coefandpa.expn”);pa=CreateList_L(NodeNum_pa);Printf(“inputNodeNum_pb:”);Scanf(“%d”,&NodeNum_pb);prin
6、tf(“Pleaseinputthepb.coefandpb.expn”);pb=CreateList_L(NodeNum_pb);Pc=Addpolyn(pa,pb);P=pc;printf(“result:”);while(p->next){p=p->next;printf(“pc.coef=%d,pc.expn=%d”,p->coef,p->expn);}//endofwhilegetch();}endofmain()function运行结果:输入:coef=6expn=5coef=5expn=4coef=4
7、expn=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 分析单链表、循环链表和双向链表的相同点和不同点，及各自的特
8、点。2.3 已知L是无表头结点的单链表，且P结点既不是首结点，也不是尾结点，试从下列提供的语句中选出合适的语句序列。(1)在P结点后插入S结点：_④_①________(2)在P结点前插入S结点：__________(3)在表首插入S结点：__________(4)在表尾插入S结点：__________
