余辉-
#include"stdafx.h"
#include "iostream.h"
class yyhMP_NODE;
class yyhNODE//节点类
{
public:
float coef;
int exp;
yyhNODE *next;
yyhNODE(float f,int e,yyhMP_NODE* a);
~yyhNODE();
};
class yyhMP_NODE//多项式类
{public:
yyhNODE *head;
yyhNODE *tail;
yyhMP_NODE(int flag);
yyhMP_NODE add(yyhMP_NODE&pb);//相加
friend yyhNODE;
void Show();
void sort();
~yyhMP_NODE();
};
class yyhMATRIX_MP//矩阵类
{
yyhMP_NODE *b[100][100];
int row;
int col;
public:
yyhMATRIX_MP(){}
yyhMATRIX_MP(int r,int c);
yyhMATRIX_MP (yyhMATRIX_MP &rm);
yyhMATRIX_MP operator+(yyhMATRIX_MP&rm);
void show();
};
yyhNODE::~yyhNODE()
{
cout<<"destructing..."<<endl;
}
yyhNODE::yyhNODE(float f,int e,yyhMP_NODE* a)
{
coef=f;
exp=e;
next=0;
if(a->head==0)
{
a->head=this;
a->tail=this;
}
else
{
a->tail->next=this;
a->tail=this;
}
}
yyhMP_NODE::yyhMP_NODE(int flag)
{ head=0;
tail=0;
float coef;
int exp;
if(flag==0)
return;
else
{
cout<<"请输入系数和指数(指数不同):"<<endl;
while(1)
{
cout<<"请输入系数:"<<endl;
cin>>coef;
if(coef==0) break;
cout<<"请输入指数:"<<endl;
cin>>exp;
new yyhNODE( coef,exp, this);
}
}
}
yyhMATRIX_MP::yyhMATRIX_MP(int r,int c)
{
this->row=r;
this->col=c;
for(int i=1;i<=row;i++)
for(int j=1;j<=col;j++)
{b[i][j]=new yyhMP_NODE(i*j);
b[i][j]->sort();
}
}
yyhMATRIX_MP::yyhMATRIX_MP(yyhMATRIX_MP &rm)
{for(int i=1;i<=row;i++)
for(int j=1;j<=col;j++)
{ b[i][j]=new yyhMP_NODE(0);
*b[i][j]=*rm.b[i][j];
}
}
yyhMATRIX_MP yyhMATRIX_MP:: operator+(yyhMATRIX_MP&rm)
{
yyhMATRIX_MP t;
for(int i=1;i<=row;i++)
for(int j=1;j<=col;j++)
{
t.b[i][j]=new yyhMP_NODE(0);
*t.b[i][j]=this->b[i][j]->add(*(rm.b[i][j]));
}
return t;
}
yyhMP_NODE yyhMP_NODE::add(yyhMP_NODE& pb)
{
yyhNODE *pacur=head,*pbcur=pb.head;
float coef;
int exp;
yyhMP_NODE *tp=new yyhMP_NODE(0) ;
while(pacur!=0&&pbcur!=0)
{
if(pacur->exp > pbcur->exp)//pacur指数大
{
coef=pacur->coef;
exp=pacur->exp;
pacur=pacur->next;
}
else if(pacur->exp < pbcur->exp)//pbcur指数大
{
coef=pbcur->coef;
exp=pbcur->exp;
pbcur=pbcur->next;
}
else//指数相等
{
coef=(pacur->coef+pbcur->coef);
exp=pbcur->exp;
pacur=pacur->next;
pbcur=pbcur->next;
}
if(coef!=0)
new yyhNODE(coef,exp,tp);
}
//经过上面循环处理后，pacur与pbcur必有一个已经处理完成
while(pacur!=0)//pbcur处理完成后，直接将pacur剩下的项加入结果中即可
{
coef=pacur->coef;
exp=pacur->exp;
pacur=pacur->next;
if(coef!=0)
{
new yyhNODE(coef,exp,tp);
}
}
while(pbcur!=0)//paur处理完成后，直接将pbcur剩下的项加入结果中即可
{
coef=pbcur->coef;
exp=pbcur->exp;
pbcur=pbcur->next;
if(coef!=0)
{
new yyhNODE(coef,exp,tp);
}
}
return *tp;
}
//输出多项式
void yyhMP_NODE::Show()
{ yyhNODE *mp=head;
while(mp!=0)
{if(mp->exp==1)
{
if(mp->coef==1)
cout<<"X";
else if(mp->coef==-1)
cout<<"-X";
else cout<<mp->coef<<"X";
}
else if(mp->exp==0)
cout<<mp->coef;
else if(mp->coef==1)
cout<<"X^"<<mp->exp;
else if(mp->coef==-1)
cout<<"-X^"<<mp->exp;
else
cout<<mp->coef<<"X^"<<mp->exp;
mp=mp->next;
if(mp!=0)
{if(mp->coef>0)
cout<<"+";
}
}
}
//输出矩阵
void yyhMATRIX_MP::show()
{
for(int i=1;i<=row;i++)
for(int j=1;j<=col;j++)
{ cout<<" ";
this->b[i][j]->Show();
if(j==col)
cout<<endl;
}
}
//将链表排序
void yyhMP_NODE::sort()
{
yyhNODE *b,*c;
int texp;
float tcoef;
for (b=head; b; b=b->next) {
for (c=head; c->next; c=c->next) {
if (c->exp<c->next->exp) {
texp=c->exp;
c->exp=c->next->exp;
c->next->exp=texp;
tcoef=c->coef;
c->coef=c->next->coef;
c->next->coef=tcoef;
}
}
}
}
yyhMP_NODE::~yyhMP_NODE()
{
yyhNODE *tp=head;
while(head!=0)
{
tp=head;
head=head->next;
delete tp;
}
}
int main(int argc, char* argv[])
{
yyhMATRIX_MP a(2,2);
a.show();
yyhMATRIX_MP b(2,2);
b.show();
yyhMATRIX_MP c=a+b;
c.show();
return 0;
}
Chen-
我这个程序实现多项式相加相减相乘，用单链表实现
#include<iostream>
#include"LinkList.h"
using namespace std;
//定义单项式
class Monomial
{
public:
int coef;
int exp;
friend bool operator!=(const Monomial&,const Monomial&);
};
void print(const Monomial &m)
{
if(m.coef>0)
{
cout<<"+"<<m.coef;
if(m.exp>1)
cout<<"x^"<<m.exp;
if(m.exp==1)
cout<<"x";
}
else
{
cout<<m.coef;
if(m.exp>1)
cout<<"x^"<<m.exp;
if(m.exp==1)
cout<<"x";
}
}
//定义多项式类，多项式为一系列单项式组成
class Polynomial:public LinkList<Monomial>
{
public:
Polynomial();
Polynomial(const Polynomial&);
void AppendMonomial(const Monomial&);
friend Polynomial operator+(const Polynomial&,const Polynomial&);
friend Polynomial operator-(const Polynomial&,const Polynomial&);
friend Polynomial operator*(const Polynomial&,const Polynomial&);
};
Polynomial::Polynomial(){}
Polynomial::Polynomial(const Polynomial&r):LinkList<Monomial>(r){}
void Polynomial::AppendMonomial(const Monomial& m)
{
Append(m);
}
Polynomial operator+(const Polynomial& pa,Polynomial& pb)
{
Polynomial pc;
Monomial ma,mb,mc;
int i=1,j=1;
int la=pa.Length();
int lb=pb.Length();
while(i<=la && j<=lb)
{
pa.GetElem(ma,i);
pb.GetElem(mb,j);
if(ma.exp<mb.exp)
{
pc.AppendMonomial(ma);
i++;
}
else if(ma.exp>mb.exp)
{
pc.AppendMonomial(mb);
j++;
}
else
{
mc.coef=ma.coef+mb.coef;
if(mc.coef!=0)
{
mc.exp=ma.exp;
pc.AppendMonomial(mc);
}
i++;
j++;
}
}
while(i<=la)
{
pa.GetElem(ma,i);
pc.AppendMonomial(ma);
i++;
}
while(j<=lb)
{
pb.GetElem(mb,j);
pc.AppendMonomial(mb);
j++;
}
return pc;
}
//实现两个多项式的减法
Polynomial operator-(const Polynomial& pa,Polynomial& pb)
{
Polynomial pc;
Monomial ma,mb,mc;
int i=1,j=1;
int la=pa.Length();
int lb=pb.Length();
while(i<=la && j<=lb)
{
pa.GetElem(ma,i);
pb.GetElem(mb,j);
if(ma.exp<mb.exp)
{
pc.AppendMonomial(ma);
i++;
}
else if(ma.exp>mb.exp)
{
mb.coef=-mb.coef;
pc.AppendMonomial(mb);
j++;
}
else
{
mc.coef=ma.coef-mb.coef;
if(mc.coef!=0)
{
mc.exp=ma.exp;
pc.AppendMonomial(mc);
}
i++;
j++;
}
}
while(i<=la)
{
pa.GetElem(ma,i);
pc.AppendMonomial(ma);
i++;
}
while(j<=lb)
{
pb.GetElem(mb,j);
mb.coef=-mb.coef;
pc.AppendMonomial(mb);
j++;
}
return pc;
}
//实现两个多项式的乘法
Polynomial operator*(const Polynomial& pa,const Polynomial& pb)
{
Polynomial pc;
Monomial ma,mb,mc,md,me,mf;
int i=1,j=1,k=1;
int la=pa.Length();
int lb=pb.Length();
for(i=1;i<=la;i++)
{
pa.GetElem(ma,i);
for(j=1;j<=lb;j++)
{
pb.GetElem(mb,j);
mc.coef=ma.coef*mb.coef;
mc.exp=ma.exp+mb.exp;
if(i==1 && j==1)
pc.AppendMonomial(mc);
else
{
pc.GetElem(md,1);
pc.GetElem(me,pc.Length());
if(mc.exp<md.exp)
pc.Insert(mc,1);
else if(mc.exp==me.exp)
{
if(mc.coef+me.coef==0)
{pc.Delete(mc,pc.Length());}
else
{
mf.coef=mc.coef+me.coef;
mf.exp=mc.exp;
pc.SetElem(mf,pc.Length());
}
}
else if(mc.exp>me.exp)
pc.Insert(mc,pc.Length()+1);
else
for(k=1;k<pc.Length();k++)
{
pc.GetElem(md,k);
pc.GetElem(me,k+1);
if(mc.exp<me.exp && mc.exp>=md.exp){
if(mc.exp==md.exp)
{
if(mc.coef+md.coef==0)
{pc.Delete(mc,k);}
else
{
mf.coef=mc.coef+md.coef;
mf.exp=mc.exp;
pc.SetElem(mf,k);
}
}
else
pc.Insert(mc,k+1);
}
}
}
}
}
return pc;
}
//通过键盘的方式建立起一个多项式
void Create(Polynomial& p)
{
Monomial m;
int n;
cout<<"input the number of monomial of the polynomial ";
cin>>n;
cout<<"逐项输入 "<<n<<" 项的一元多项式，每一项格式为
：系数 指数"<<endl;
for(int i=0;i<n;i++)
{
cin>>m.coef>>m.exp;
p.AppendMonomial(m);
}
}
int main()
{
Polynomial pa,pb;
cout<<"----此程序实现一元多项式的相加----"<<endl<<endl;
cout<<"input polynomial A"<<endl;
Create(pa);
cout<<"polynomial A is"<<endl;
pa.Traverse(print);
cout<<endl;
cout<<"input polynomial B"<<endl;
Create(pb);
cout<<"polynomial B is"<<endl;
pb.Traverse(print);
cout<<endl<<endl;
Polynomial pc;
pc=pa+pb;
cout<<"after addition between the two polynomial,result is"<<endl;
pc.Traverse(print);
cout<<endl<<endl;
cout<<"现在验证这两个多项式的减法"<<endl;
pc=pa-pb;
cout<<"polynomial A is"<<endl;
pa.Traverse(print);
cout<<endl;
cout<<"polynomial B is"<<endl;
pb.Traverse(print);
cout<<endl;
cout<<"after submition ,result is "<<endl;
pc.Traverse(print);
cout<<endl<<endl;
cout<<"现在验证这两个多项式的乘法"<<endl;
pc=pa*pb;
cout<<"polynomial A is"<<endl;
pa.Traverse(print);
cout<<endl;
cout<<"polynomial B is"<<endl;
pb.Traverse(print);
cout<<endl;
cout<<"after multipication,result is "<<endl;
pc.Traverse(print);
cout<<endl<<endl;
cout<<"good job!"<<endl;
system("pause");
return 0;
}