多項(xiàng)式加減法

一實(shí)驗(yàn)?zāi)康脑O(shè)計(jì)一個(gè)一元稀疏多項(xiàng)式簡單計(jì)算器。二、實(shí)驗(yàn)要求能創(chuàng)建和實(shí)現(xiàn)多項(xiàng)式的加減等各種功能。三、實(shí)驗(yàn)內(nèi)容一元稀疏多項(xiàng)式的基本功能：輸入并建立多項(xiàng)式；輸出多項(xiàng)式，輸出的形式為整數(shù)序列:n,c1,e1,c2,e2,……,cn,en,其中n是多項(xiàng)式的項(xiàng)數(shù)，ci和ei分別是第i項(xiàng)的系數(shù)和指數(shù)，序列按指數(shù)降序排列。多項(xiàng)式a和b相加，建立多項(xiàng)式a+b；多項(xiàng)式a和b相加，建立多項(xiàng)式a-b；四、程序源代碼#include<stdio.h>#include<malloc.h>#defineNULL0typedefstruct LNode{ floatcoef; intexpn; structLNode*next;}LNode,*Linklist;/////////////////////////////////////////////////LNode*creat(intcount)///////////////////////////創(chuàng)建鏈表，存放多項(xiàng)式{ Linklistp1,p2,head; intn=0; p1=p2=(Linklist)malloc(sizeof(LNode)); scanf("%f%d",&p1->coef,&p1->expn); head=NULL; while(n<count) { n=n+1; if(n==1)head=p1; elsep2->next=p1; p2=p1; p1=(Linklist)malloc(sizeof(LNode)); if(n!=count) { scanf("%f%d",&p1->coef,&p1->expn); } } p2->next=NULL; return(head);}Linklistsort(Linklisthead)////////////////////////對多項(xiàng)式按指數(shù)降序排序{ Linklistp0,p1,p2; inti=0; ints; floatf; p0=p1=head; while(p0) { i++; p0=p0->next; } for(intj=0;j<i-1;j++) { p1=head; while(p1->next) { p2=p1; p1=p1->next; if(p1->expn>p2->expn) { f=p1->coef; s=p1->expn; p1->coef=p2->coef; p1->expn=p2->expn; p2->coef=f; p2->expn=s; } } } returnhead;}/////////////////////////////////////////////////////合并系數(shù)相同的項(xiàng)Linklistmerge(Linklisthead){ Linklistp1,p2; p1=p2=head; while(p1) { p2=p1; p1=p1->next; while(p1&&p1->expn==p2->expn) { p2->coef+=p1->coef; p2->next=p1->next; free(p1); p1=p2->next; } } returnhead;}/////////////////////////////////////////////////////輸入多項(xiàng)式各項(xiàng)系數(shù)及指數(shù)voidprint(Linklisthead){ Linklistp,q; intcount=0; q=head; while(q) { q=q->next; count++; } printf("多項(xiàng)式中的各項(xiàng)系數(shù)指數(shù)依次為:\n"); printf("%d",count); p=head; if(head==NULL) printf("所得結(jié)果為0！\n"); if(head!=NULL) do {printf("\t%4.2fX%d",p->coef,p->expn); p=p->next; }while(p!=NULL); printf("\n");}///////////////////////////////////////////////////////出去系數(shù)為零的項(xiàng)Linklistdel_Zero(Linklisthead){ Linklistp1,p2; if(head==NULL) { printf("\nlistnull!\n");returnhead; } p1=p2=head; while(p1) { p2=p1; p1=p1->next; while(p1&&p1->coef==0) { if(p1==head)head=p1->next; else { p2->next=p1->next; p1=p2->next; } } } if(head->coef==0) head=head->next; return(head);}///////////////////////////////////////////////////////連接函數(shù)LinklistList_Link(LinklistL1,LinklistL2){ Linklistp; p=L1; while(p&&p->next) p=p->next; if(p==NULL) L1=L2; else p->next=L2; L2=NULL; returnL1;}voidmain(){ intcount1,count2; LinklistL1,L2,p; printf("輸入第一個(gè)多項(xiàng)式的項(xiàng)數(shù):\n"); scanf("%d",&count1); while(count1<0) { printf("輸入不合法，重新輸入:\n"); scanf("%d",&count1); } printf("依次輸入各項(xiàng)的系數(shù)和指數(shù):\n"); L1=creat(count1); sort(L1); //print(L1); printf("輸入第二個(gè)多項(xiàng)式的項(xiàng)數(shù):\n"); scanf("%d",&count2); while(count2<0) { printf("輸入不合法，重新輸入:\n"); scanf("%d",&count2); } printf("依次輸入各項(xiàng)的系數(shù)和指數(shù):\n"); L2=creat(count2); sort(L2); //print(L2); intchioce; printf("http://////////////////////////////////////////////\n"); printf("多項(xiàng)式相加輸入1，多項(xiàng)式做差輸入2:\n"); scanf("%d",&chioce); switch(chioce) { case1: L1=List_Link(L1,L2);break; case2: p=L2; while(p) { p->coef=-p->coef; p=p->next; } L1=List_Link(L1,L2);break; default: