线性表的基本运算及多项式的算术运算

#include

class Polynominal;

class Term

{

public:

Term(int c,int e);

Term(int c,int e,Term *nxt);

Term* InsertAfter(int c,int e);

private:

int coef;

int exp;

Term* link;

friend ostream & operator <<(ostream &,const Term &); friend class Polynominal;

};

Term::Term(int c,int e):coef(c),exp(e)

{

link=0;

}

Term::Term(int c,int e,Term *nxt):coef(c),exp(e)

{

link=nxt;

}

Term* Term::InsertAfter(int c,int e)

{

link=new Term(c,e,link);

return link;

}

ostream &operator <<(ostream & out ,const Term&val) {

if (val.coef==0)

{

return out;

}

out<

switch (val.exp)

{

case 0:break;

case 1:out<<"x";break;

default:out<<"x^"<

}

return out;

}

class Polynominal

{

public:

Polynominal();

~Polynominal();

void AddTerms(istream &in);

void Output(ostream & out)const;

void Output()const;

void PolyAdd(Polynominal &r);

void PolyMultiplication(Polynominal &r);

private:

Term* theList;

friend ostream & operator <<(ostream &,const Polynominal&); friend istream & operator >>(istream &,Polynominal &);

friend Polynominal & operator +(Polynominal &,Polynominal &); friend Polynominal & operator *(Polynominal &,Polynominal &); };

Polynominal::Polynominal()

{

theList=new Term(0,-1);

theList->link=theList;

}

Polynominal::~Polynominal()

{

Term* p=theList->link;

while (p!=theList)

{

theList->link=p->link;

delete p;

p=theList->link;

}

delete theList;

}

void Polynominal::AddTerms(istream &in)

{

Term *q=theList;

int c,e;

for (;;)

{

cout<<"Input a term (coef,exp):\n"<

cin>>c>>e;

if (e<0)

{

break;

}

q=q->InsertAfter(c,e);

}

}

void Polynominal::Output(ostream & out)const {

int first=1;

Term *p=theList->link;

cout<<"The polynominal is:\n"<

for(;p!=theList;p=p->link)

{

if(!first&&(p->coef>0))

cout<<"+";

first=0;

cout<<*p;

}

cout<<"\n"<

}

void Polynominal::Output()const

{

int first=1;

Term *p=theList->link;

cout<<"The polynominal is:\n"<

for(;p!=theList;p=p->link)

{

if(!first&&(p->coef>0))

cout<<"+";

first=0;

cout<<*p;

}

cout<<"\n"<

}

void Polynominal::PolyAdd(Polynominal &r) {

Term *q,*q1=theList,*p;

p=r.theList->link;

q=q1->link;

while(p->exp>=0)

{

while(p->expexp)

{

q1=q;

q=q->link;

}

if (p->exp==q->exp)

{

q->coef=q->coef+p->coef;

if (q->coef==0)

{

q1->link=q->link;

delete (q);

q=q1->link;

}

else

{

q1=q;

q=q->link;

}

}

else

{

q1=q1->InsertAfter(p->coef,p->exp);

}

p=p->link;

}

}

void Polynominal::PolyMultiplication(Polynominal &r)

{

Term *q, *q1=theList,*p,*t; //q1指向头结点

Polynominal *s,w; //指针s用于申请动态空间，w做临时储存器

p=r.theList->link; //p指向第一个要处理的节点

q=q1->link; //q1是q的前驱，p和q就指向两个操作项

while(p->exp>=0&&q->exp>=0)

{

s=new Polynominal; //申请动态空间

t=s->theList->link; //t指向新申请的空间

t->InsertAfter(q->coef*p->coef,q->exp+p->exp); //在新申请的空间中插入两项相乘结果

if (q->link!=theList) //判断遍历是否结束

q=q->link;

else

{

p=p->link;

q=q1->link; //由于二项式链表是循环链表，此句即为q指向头结点

}

w.PolyAdd(*s); //在临时储存器中插入s

}

delete s; //释放动态空间s

Term * m=theList->link; //以下几句为将原来节点删除while (m!=theList)

{

theList->link=m->link;

delete m;

m=theList->link;

}

theList->link=theList;

this->PolyAdd(w); //将w付给this指针

}

ostream& operator<<(ostream & out ,const Polynominal &x)

{

x.Output(out);

return out;

}

istream & operator>>(istream &in ,Polynominal &x)

{

x.AddTerms(in);

return in;

}

Polynominal & operator +(Polynominal &a,Polynominal &b)

{

a.PolyAdd(b);

return a;

}

Polynominal & operator *(Polynominal &a,Polynominal &b)

{

a.PolyMultiplication(b);

return a;

}

int main()

{

Polynominal p,q;

cin>>p;

cout<

cin>>q;

cout<

//q=q+p;

q=q*p;

cout<

return 0;

}