#include<iostream> using namespace std; typedef struct node {int ele;int po;struct node *next; } Node,*List; void Create(List &L,int n) {List p,flag;L=(List)malloc(sizeof(Node));L->next=NULL;flag=L;printf("輸入%d數據\n",n);for(int i=1; i<=n; i++) {p=(List)malloc(sizeof(Node));scanf("%d%d",&p->ele,&p->po);flag->next=p;flag=flag->next;}p->next=NULL; } void Print(List L) {List p=L->next;while(p) {if(p->ele != 0) {printf("%dX^%d",p->ele,p->po);}if(p->next) {printf("+");}p=p->next;}printf("\n"); } List Sum(List La,List Lb) {List pa, pb, pc, Lc;pa = La->next;pb = Lb->next;Lc = pc = La;while(pa&&pb) {if(pa->po < pb->po) {pc->next = pa;pc = pa;pa = pa->next;} else if (pa ->po > pb->po) {pc->next = pb;pc = pb;pb = pb->next;} else {pa->ele = pa->ele + pb->ele;pc->next = pa;pc = pa;pa = pa->next;pb = pb->next;}}pc->next = pa ? pa:pb;return Lc; } int main() {List ha,hb,hc; //定義三個多項式printf("ha的項數");printf("非遞減輸入項式ha ");int n;scanf("%d",&n);Create(ha,n);printf("hb的項數");printf("非遞減輸入項式hb ");scanf("%d",&n);Create(hb,n);printf("項式ha :");Print(ha);printf("項式hb :");Print(hb);hc = Sum(ha,hb);printf("項式hc :");Print(hc);return 0; }

總結

以上是生活随笔為你收集整理的多项式ADT的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。