单链表的结点定义:
typedef struct node{
int coef,exp;
struct node *next;
}Lnode,*LinkList;
相加函数的算法:
void Addploy(LinkList &la,LinkList &lb)
{
LinkList pa,pb,re,u;
int x;
pa=la->next;
pb=lb->next;
re=pa;
while(pa&&pb)
{
if(pa->exp<pb->exp)
{re=pa;pa=pa->next;}
else if(pa->exp==pb->exp)
{
x=pa->coef+pb->coef;
if(x!=0)
{pa->coef=x;re=pa;}
else if(x==0)
{re->next=pa->next;free(pa);}
pa=re->next;u=pb;pb=pb->next;free(u);
}
else
{u=pb->next;pb->next=pa;re->next=pb;re=pb;pb=u;}
}
if(pa==NULL)
{re->next=pb;}
free(lb);
}
完整的程序:
#include<stdio.h>
#include<iostream>
#define OVERFLOW -2
using namespace std;
typedef struct node{
int coef,exp;
struct node *next;
}Lnode,*LinkList;
LinkList la,lb;
void CreateNode(LinkList &l,int n)
{
int i;
LinkList p,s;
l=(LinkList)malloc(sizeof(Lnode));
if(!l) exit(OVERFLOW);
l->next=NULL;
p=l;
for(i=1;i<=n;i++)
{
s=(LinkList)malloc(sizeof(Lnode));
if(!s) exit(OVERFLOW);
p->next=s;
s->next=NULL;
cout<<"请输入该项的系数:"<<endl;
cin>>s->coef;
cout<<"请输入该项的指数:"<<endl;
cin>>s->exp;
p=p->next;
}
}
void Addploy(LinkList &la,LinkList &lb)
{
LinkList pa,pb,re,u;
int x;
pa=la->next;
pb=lb->next;
re=pa;
while(pa&&pb)
{
if(pa->exp<pb->exp)
{re=pa;pa=pa->next;}
else if(pa->exp==pb->exp)
{
x=pa->coef+pb->coef;
if(x!=0)
{pa->coef=x;re=pa;}
else if(x==0)
{re->next=pa->next;free(pa);}
pa=re->next;u=pb;pb=pb->next;free(u);
}
else
{u=pb->next;pb->next=pa;re->next=pb;re=pb;pb=u;}
}
if(pa==NULL)
{re->next=pb;}
free(lb);
}
int main()
{
int na,nb;
cout<<"******创建多项式A******"<<endl;
cout<<"请输入多项式的项数:"<<endl;
cin>>na;
CreateNode(la,na);
cout<<"******创建多项式B******"<<endl;
cout<<"请输入多项式的项数:"<<endl;
cin>>nb;
CreateNode(lb,nb);
cout<<"******实现多项式A和B的相加******"<<endl;
Addploy(la,lb);
cout<<"相加以后的多项式变为:"<<endl;
LinkList t;
for(t=la->next;t;t=t->next)
{
cout<<t->coef<<" ";
cout<<t->exp<<" ";
cout<<endl;
}
}
运行结果:
EG:(9x8 为 9乘以x的8次幂)
A(x)=7+3x+9x8+5x17
B(x)=8x+22x7-9x8
C(x)=7+11x+22x7+5x17