一元多项式的加法与乘法运算
设计函数分别求两个一元多项式的乘积与和
输入样例:
4 3 4 -5 2 6 1 -2 0
3 5 20 -7 4 3 1
输出样例
15 24 -25 22 30 21 -10 20 -21 8 35 6 -33 5 14 4 -15 3 18 2 -6
5 20 -4 4 -5 2 9 1 -2 0
#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;//新申请的P插到rear后面
*pRear = P; //当前链表的最后一个节点
}
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,temp;
int sum;
t1=P1;t2=P2;
P=(Polynomial)malloc(sizeof(struct PolyNode));
P->link=NULL;
Rear=P;
while(t1&&t2){
if(t1->expon==t2->expon){
sum=t1->coef+t2->coef;
if(sum) Attach(sum,t1->expon,&Rear);
t1=t1->link;
t2=t2->link;
}
else if(t1->expon>t2->expon){
Attach(t1->coef,t1->expon,&Rear);
t1=t1->link;
}
else{
Attach(t2->coef,t2->expon,&Rear);
t2=t2->link;
}
}
while(t1){
Attach(t1->coef,t1->expon,&Rear);
t1=t1->link;
}
while(t2){
Attach(t2->coef,t2->expon,&Rear);
t2=t2->link;
}
t2=P;P=P->link;free(t2);
return P;
}
Polynomial Mult(Polynomial P1,Polynomial P2)
{
Polynomial P,Rear,t1,t2,t;
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的第1项乘以P2,得到P
Attach(t1->coef*t2->coef,t1->expon+t2->expon,&Rear);
t2=t2->link;
}
t1=t1->link;
while(t1){
t2=P2;Rear=P;
while(t2){
e=t1->expon+t2->expon;//指数相加
c=t1->coef*t2->coef; //系数相乘
//插入
while(Rear->link && Rear->link->expon>e)
Rear = Rear->link;
if(Rear->link && Rear->link->expon==e){
if(Rear->link->coef+c){
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;
}
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");
}
int main(){
Polynomial P1,P2,PP,PS;
P1 = ReadPoly();
P2 = ReadPoly();
PP = Mult(P1,P2);
PrintPoly(PP);
PS = Add(P1,P2);
PrintPoly(PS);
return 0;
}
数据结构真的难,慢慢来呀