#ifndef LINKLIST_H
#define LINKLIST_H
struct elem
{
int data;
int exp;
elem* next;
};
class LinkList
{
public:
LinkList();
LinkList(int a[][2],int n);
~LinkList();
void PrintList();
friend void Add(LinkList &A,LinkList &B);
private:
elem * first;
};
#endif
#include
#include"LinkList.h"
using namespace std;
LinkList::LinkList()
{
first=new elem;
first->next=NULL;
}
LinkList::LinkList(int a[][2],int n) //尾插法建立单链表
{
first=new elem;
elem*r=first;
for(int i=0;i
{
elem*s=new elem;
s->data=a[i][0];
s->exp=a[i][1];
r->next=s;
r=s;
}
r->next=NULL;
}
LinkList::~LinkList()
{
while(first!=NULL)
{
elem *q=first;
first=first->next;
delete q;
}
}
void LinkList::PrintList()
{
elem*p=first->next;
while(p!=NULL)
{
cout<data<<"*X^"<exp<<"+";
p=p->next;
}
}
#include
#include "LinkList.h"
using namespace std;
void Add(LinkList &A,LinkList &B);
void main()
{
int a[][2]={{2,4},{3,5},{4,8}};
int b[][2]={{8,1},{7,2},{3,4},{5,8}};
LinkList A(a,3);
cout<<"多项式A为："<
A.PrintList();
cout
LinkList B(b,4);
cout
B.PrintList();
cout
cout
try{
Add(A,B);
}
catch(char *wrong)
{
cout
}
}
void Add(LinkList &A,LinkList &B)
{
elem*pre=A.first;elem*p=pre->next;
elem*qre=B.first;elem*q=qre->next;
while(p!=NULL&&q!=NULL)
{
if(p->expexp) //p的指数小于q的指数
{
pre=p;
p=p->next;
}
else if(p->exp>q->exp)//p的指数大于q的指数
{
elem*v=q->next;
pre->next=q;
q->next=p;
q=v;
}
else //指数相等
{
p->data=p->data+q->data;
if(p->data==0) //如果相加后p的系数为0
{
pre->next=p->next;
delete p;
p=p->next;
}
else
{
pre=p;
p=pre->next;
}
qre->next=q->next;
delete q;
q=qre->next;
}
}
if(q!=NULL)
pre->next;
delete B.first; //释放第二个单链表头结点所占的内存；
A.PrintList();
}
