链表多项式的基本运算加减乘

#include<iostream>
using namespace std;


class Node
{
public:
float coffienet;
int index;
Node*next;
Node(int index,float coffienet,Node*nextnode=NULL)
{
this->index=index;
this->coffienet =coffienet;
next=nextnode;
}
Node(Node*nextnode=NULL)
{
next=nextnode;
}


//
//void MUL(Node&,Node&);
~Node()
{}
};
#define LIST list
class list
{
private:
Node*head;//头指针
Node*tail;//尾指针
Node*curr;//当前指针
public:
list(int sz);//构造函数
~list();//析构函数
void clear();
void insert(float a,int b);
void setFirst();
void remove();
void display();
friend void AND(LIST&,LIST&);
friend void SUB(LIST&,LIST&);
friend void MUL(LIST&,LIST&);

};

#include<iostream>
using namespace std;
#include"h.h"




list::list(int size)
{
head=curr=new Node;
}
list::~list()
{
while(head!=NULL)
{
curr=head;
head=head->next;
delete curr;
}
;


}
void list::clear() 
{
while(head->next!=NULL)
{
curr=head->next;
head->next=curr->next;
delete curr;
}
curr=head;
}
void list::insert(float cofficent,int index)
{
if(curr!=NULL)
{
if(curr->next ==NULL)
{
curr->next=new Node(index,cofficent,curr->next);
}
else
{
while(curr->next!=NULL&&curr->next->index <index)
{
curr=curr->next;
}
if(curr->next!=NULL&&curr->next->index==index)
{
curr->next->coffienet+=cofficent;
}
else
curr->next =new Node(index,cofficent,curr->next);
}

}
else
{
cout<<"插入失败，请检查当前位置"<<endl;
exit(1); 
}
}
void list::setFirst() 
{
curr=head;
}
void list::display ()
{
Node *tmp=head->next;
while(tmp!=NULL)
{
if(tmp!=head->next)
{
if(tmp->coffienet>0)
cout<<"+";
if(tmp->index!=0)
{
cout<<tmp->coffienet <<'X'<<tmp->index ;
}
else
{
cout<<tmp->coffienet ;
}
}
else
{
if(tmp->index !=0)
{
cout<<tmp->coffienet<<'X'<<tmp->index;
}
else
{
cout<<tmp->coffienet;
}
}
tmp=tmp->next;
}
cout<<endl;
}

#include<iostream>
using namespace std;
#include"h.h"
void AND(LIST&pa,LIST&pb) 
{
Node *p,*q,*u,*pre;
float x;
p=pa.head->next;
q=pb.head->next ;
pre=pa.head;

//下面分为三种判断
while(p!=NULL&&q!=NULL)
{
if(p->index <q->index )
{
pre=p;
p=p->next;
}
else if(p->index==q->index )
{
x=p->coffienet +q->coffienet ;
if(x!=0)
{
p->coffienet=x;
pre=p;
}
else
{
pre->next=p->next ;
free(p);
}
p=pre->next;
u=q;
q=q->next;
free(u);


}
else if(p->index >q->index )
{
u=q->next ;
q->next=p;
pre=q;
q=u;

}
}
if(q!=NULL)
{
pre->next=q;
}
free(pb.head );
pb.head=NULL;
cout<<"结果式为：";
pa.display ();


}
void SUB(LIST&pa,LIST&pb) 
{
Node *p,*q,*u,*pre;
float x;
p=pa.head->next;
q=pb.head->next ;
pre=pa.head;

//下面分为三种判断
while(p!=NULL&&q!=NULL)
{
if(p->index <q->index )
{
pre=p;
p=p->next;
}
else if(p->index==q->index )
{
x=p->coffienet -q->coffienet ;
if(x!=0)
{
p->coffienet=x;
pre=p;
}
else
{
pre->next=p->next ;
free(p);
}
p=pre->next;
u=q;
q=q->next;
free(u);


}
else if(p->index >q->index )
{
u=q->next;

//因为为减法所以在进行插入的过程中需要进行换号操作,用重载函数,懒得写了
float m=q->coffienet;
q->coffienet =-m;
q->next=p;
pre->next=q;
pre=q;
q=u;

}
}
if(q!=NULL)
{
while(q!=NULL)
{
            float m=q->coffienet;
q->coffienet =-m;
q=q->next;
}
pre->next=q;
}
free(pb.head );
pb.head=NULL;
cout<<"结果式为：";
pa.display ();


}
void MUL(LIST&pa,LIST&pb) 
{
Node *p,*q,*u,*pre;
list pc(5);
float x;
int y;
p=pa.head->next;
q=pb.head->next ;
//pre=pb.head;
while(p!=NULL)
{
      x=p->coffienet*q->coffienet ;
 y=p->index+q->index;
 pc.insert (x,y);
 /*p->coffienet=x;
 p->index=y;*/
 q=q->next;
 if(q==NULL)
 {
 u=p;
 p=p->next;
 free(u);
 q=pb.head->next ;  
 }
}
free(pb.head);
free(pa.head);
pb.head=NULL;
pa.head=NULL;
pc.display ();
}

#include<iostream>
using namespace std;
#include"h.h"
void SetUP(list&pre)
{
int a,b;
float c;
    cout<<"输入PA多项式，输入格式为（系数,指数）,一共有几项"<<endl;
cin>>a;
int i=0;
while(i<a)
{
cout<<"开始输入格式为（系数,指数）"<<endl;
cin>>c>>b;
pre.insert (c,b);
i++;  
}
pre.display ();
}
int main()
{
cout<<"下面开始准备输入多项式"<<endl;
int LIST_SIZE=5;
list pa(LIST_SIZE);
list pb(LIST_SIZE);
SetUP(pa);
SetUP(pb);


cout<<"下面一共有三种操作对于多项式，分别是①是加法，②是减法，③是乘法"<<endl;
int i;
cin>>i;
switch(i)
{
case 1:AND(pa,pb);break;
case 2:SUB(pa,pb);break;
case 3:MUL(pa,pb);break;
}
return 0;
}