#include<stdio.h>
#include<stdlib.h>
typedef struct PolyNode *Polynomial;
struct PolyNode{
int coef;
int expon;
Polynomial link;
};
void Attach(int c,int e,Polynomial *pRear)
{
// 读取系数和指数加入到多项式链表
Polynomial P;
P = (Polynomial)malloc(sizeof(struct PolyNode));
P->coef = c;
P->expon = e;
P->link =NULL;
(*pRear)->link = P;
*pRear = P; //更改 *pRear指针的位置,让它指向最后
}
Polynomial ReadPoly()
{
// 读取多项式数据
Polynomial P,Rear,t;
int c,e,N;
scanf("%d",&N);
// 开辟一块内存空间
P = (Polynomial)malloc(sizeof(struct PolyNode));
P -> link =NULL; //链表头指针
Rear = P;
while(N--)
{
scanf("%d %d",&c,&e);
Attach(c,e,&Rear);
}
t = P; P=P->link; free(t); //删除临时的头节点
return P;
}
Polynomial Add(Polynomial P1, Polynomial P2)
{
Polynomial t1,t2,P,Rear,t;
int sum,expon;
t1 = P1; t2 = P2;
P = (Polynomial)malloc(sizeof(struct PolyNode));
P -> link = NULL;
Rear = P; // Rear记录头节点
while(t1 && t2)
{
if(t1->expon == t2->expon)
{
sum = t1->coef + t2->coef;
expon = t1 ->expon;
if(sum)
{ //相加系数非0
Attach(sum,expon,&Rear);
t1 = t1 ->link;
t2 = t2 ->link;
}
else
{
//系数为0,跳过这个结点
t1 = t1->link;
t2 = t2->link;
}
}
else if (t1->expon > t2 ->expon)
{
sum = t1->coef;
expon = t1->expon;
Attach(sum,expon,&Rear);
t1 = t1->link;
}
else
{
sum = t2->coef;
expon = t2->expon;
Attach(sum,expon,&Rear);
t2 = t2->link;
}
}
while(t1)
{
sum = t1 ->coef;
expon = t1 -> expon;
Attach(sum,expon,&Rear);
t1 = t1 -> link;
}
while(t2)
{
sum = t2 -> coef;
expon = t2 -> expon;
Attach(sum,expon,&Rear);
t2 = t2 -> link;
}
t = P; P=P->link; free(t);
return P;
}
void PrintPoly(Polynomial P)
{
//输出多项式
int flag =0; //调整输出格式
if(!P)
{
printf("0 0\n");
return;
}
while(P)
{
if(!flag)
flag=1;
else
printf(" ");
printf("%d %d",P->coef,P->expon);
P = P->link;
}
printf("\n");
}
Polynomial Mult(Polynomial P1, Polynomial P2)
{
Polynomial t1,t2,t,P,Rear;
int c,e;
if(!P1||!P2)
return NULL;
t1=P1;t2=P2;
P=(Polynomial)malloc(sizeof(struct PolyNode));
P->link=NULL;
Rear = P;
while(t2) //先用P1的第一项乘P2
{
c = t1->coef * t2->coef;
e = t1->expon + t2->expon;
Attach(c,e,&Rear);
t2 = t2->link;
}
t1 = t1->link;
while(t1)
{ // 用P2第二项乘的时候需要遍历排序
t2 = P2; Rear = P; //每一次从表头遍历
while(t2)
{
c = t1->coef * t2->coef;
e = t1->expon + t2->expon;
while(Rear->link&&Rear->link->expon > e)
Rear = Rear->link;
if(Rear->link && Rear->link->expon == e)
{ //如果有系数等于e的结点
if(Rear->link->coef + c) //如果系数不为0
{
Rear->link->coef += c;
}
else
{
//删除这个节点
t = Rear->link;
Rear->link = t->link;
free(t);
}
}
else
{
//如果没有这个结点
t = (Polynomial)malloc(sizeof(struct PolyNode));
t->coef = c;
t->expon = e;
t->link = Rear->link;
Rear->link = t;
Rear = Rear->link;
}
t2 = t2->link;
}
t1 = t1->link;
}
t2 = P; P=P->link; free(t2);
return P;
}
int main()
{
Polynomial P1,P2,PP,PS;
P1 = ReadPoly();
P2 = ReadPoly();
PP = Mult(P1,P2);
PS = Add(P1,P2);
PrintPoly(PP);
PrintPoly(PS);
}
链表实现多项式加法和乘法
最新推荐文章于 2021-10-23 21:29:54 发布