N个一元多项式的加减乘除执行代码.docVIP

N个一元多项式的加减乘除执行代码 #include iostream using namespace std; struct Node { public: int coe; int exp; Node *next; }; class List { public: Node *CreatList(Node *Head); Node *InsertNode(Node *Head,Node *Ptr); Node *AddList(Node *Head1,Node *Head2); Node *SubList(Node *Head1,Node *Head2); Node *MulList(Node *Head1,Node *Head2); }; Node *List::CreatList(Node *Head) { int num=0; Node *Ptr=new Node; Ptr-next=NULL; cout请输入一元多项式的项数：; cinnum; for (int i=1;i=num;i++) { cout请输入多项式的第i项endl; cinPtr-coe; cinPtr-exp; if (Ptr-coe==0) { } else { InsertNode(Head,Ptr); } Ptr=new Node; Ptr-next=NULL; } return Head; } Node *List::InsertNode(Node *Head,Node *Ptr) { Node *PrePos=new Node; Node *NowPos=Head-next; if (NowPos==NULL) { Head-next=Ptr; Ptr-next=NULL; } else { PrePos=Head; while(NowPos!=NULL) { if (Ptr-expNowPos-exp) { PrePos-next=Ptr; Ptr-next=NowPos; break; } else if(Ptr-expNowPos-exp) { PrePos=NowPos; NowPos=NowPos-next; } else { if ((Ptr-coe+NowPos-coe)==0) { PrePos-next=NowPos-next; delete NowPos; break; } else { NowPos-coe=Ptr-coe+NowPos-coe; break; } } if (NowPos==NULL) { PrePos-next=Ptr; Ptr-next=NULL; } } } return Head; } Node *List::AddList(Node *Head1,Node *Head2) { Node *NewHead=new Node; Node *Ptr=new Node; Ptr-next=NULL; NewHead-next=NULL; Node *Ptr1=Head1-next; Node *Ptr2=Head2-next; if (Ptr1==NULL) { if (Ptr2==NULL) { } else { while(Ptr2!=NULL) { Ptr-coe=Ptr2-coe; Ptr-exp=Ptr2-exp; NewHead=InsertNode(NewHead,Ptr); Ptr=new Node; Ptr-next=NULL; Ptr2=Ptr2-next; } } } else { if (Ptr2==NULL) { while(Ptr1!=NULL) { Ptr-coe=Ptr1-coe; Ptr-exp=Ptr1-exp; NewHead=InsertNode(NewHead,Ptr); Ptr=new Node; Ptr-next=NULL; Ptr1=Ptr1-next; } } else { while(Ptr1!=NULL) { Ptr-coe=Pt