多项式乘法 c语言,多项式相乘.cpp

#include

#include

# define MAX 100 //多项式最多项数

typedef struct

{ double coef; //系数

int exp; //指数

} PolyArray; //存放多项式的数组类型

typedef struct pnode

{double coef; //系数

int exp; //指数

struct pnode*next;

} PolyNode; //声明多项式单链表结点类型

void DispPoly(PolyNode * L) //输出多项式单链表

{

bool first = true; //first为true表示是第一项

PolyNode *p = L->next;

while (p != NULL)

{

if (first)

first = false;

else if (p->coef > 0)

printf("+");

if (p->exp == 0)

printf("%g", p->coef);

else if (p->exp == 1)

printf("%gx", p->coef);

else

printf("%gx^%d", p->coef, p->exp);

p = p->next;

}

printf("\n");

}

void DestroyPoly(PolyNode*&L) //销毁多项式单链表

{

PolyNode * pre = L, *p= pre->next;

while (p!= NULL)

{free(pre);

pre = p;

p = pre->next;

}

free(pre);

}

void CreatePolyR(PolyNode *&L, double a[], int b[], int n) //尾插法建表

{

PolyNode *s, *r;int i;

L = (PolyNode*)malloc(sizeof(PolyNode));//创建头结点

L->next = NULL;

r = L; // r 始终指向尾结点，开始时指向头结点

for (i = 0; i < n; i++)

{ s = (PolyNode *)malloc(sizeof(PolyNode));//创建新结点

s ->coef= a[i];

s->exp = b[i];

r ->next = s; //将结点s插入到结点 r之后

r = s;

}

r->next = NULL; //尾结点next域置为NULL

}

void Sort(PolyNode *&L) // 将多项式单链表按指数递减排序

{

PolyNode *p = L->next, *pre, *q;

if (p != NULL) //L有一个或以上的数据结点

{ q = p->next; //q保存p结点的后继结点

p->next = NULL; //构造只含一个数据结点的有序表

p = q;

while (p!= NULL) //扫描原工中余下的数据结点

{

q = p->next; //q保存p结点的后继结点

pre = L;

while(pre->next!= NULL && pre->next->exp > p->exp)

pre = pre->next; //在有序表中找插人结点P的前驱结点pre

p->next = pre->next; //将结点p插人到结点pre之后

pre->next = p;

p = q; //扫描原单链表余下的结点

}

}

}

void Mult1(PolyNode *ha, PolyNode*hb, PolyNode *&hc)

{

PolyNode * pa = ha->next, *pb, *s, *tc;

hc = (PolyNode *)malloc(sizeof(PolyNode));

tc = hc;

while (pa != NULL)

{pb = hb->next;

while (pb != NULL)

{

s = (PolyNode *)malloc(sizeof(PolyNode));

s->coef = pa->coef * pb->coef;

s->exp = pa->exp + pb->exp;

tc->next = s;

tc = s;

pb = pb->next;

}

pa = pa -> next;

}

tc->next = NULL;

}

void Comb(PolyNode *&L)//合并指数相同的项

{

PolyNode *pre = L->next, *p;

if(pre == NULL) return;

p = pre->next;

while (p != NULL)

{

while (p -> exp == pre -> exp)

{

pre->coef += p->coef;

pre->next = p->next;

free(p);

p = pre->next;

}

pre = p;

p = p->next;

}

}

void DelZero(PolyNode *&L) //删除系数为0的项

{

PolyNode *pre = L, *p = pre->next;

while (p != NULL)

{ if (p->coef == 0.0)

{

pre->next=p->next;

free(p);

}

pre = p;

p = p->next;

}

}

void Mult(PolyNode * ha, PolyNode *hb, PolyNode * &hc) //ha 和hb相乘得到最终的heMult1(ha, hb, hc);

{

Mult1(ha, hb, hc);

printf("相乘结果: "); DispPoly(hc);

Sort(hc);

printf("按指数排序后: "); DispPoly(hc);

Comb(hc);

printf("合并重复指数项:"); DispPoly(hc);

DelZero(hc);

printf("删除序数为0项: "); DispPoly(hc);

}

int main()

{

PolyNode *Poly1, *Poly2, *Poly3;

double a[MAX];

int b[MAX], n;

// ----创建第1个多项式单链表并排序

a[0] = 2; b[0] = 3; a[1] = 1; b[1] = 0; a[2] = 3; b[2] = 1;

n = 3;

printf("第1个多项式:\n");

CreatePolyR(Poly1, a, b, n);

printf(" 排序前多项式1:"); DispPoly(Poly1);

Sort(Poly1);

printf(" 排序后多项式1:"); DispPoly(Poly1);

// ----创建第2个多项式单链表并排序

printf("第2个多项式:\n");

a[0] = 2; b[0] = 3; a[1] = -3; b[1] = 2;

a[2] = 5; b[2] = 4; a[3] = -3; b[3] = 0;

n = 4;

CreatePolyR(Poly2,a,b,n);

printf(" 排序前多项式2:"); DispPoly(Poly2);

Sort(Poly2);

printf(" 排序后多项式2:"); DispPoly(Poly2);

Mult(Poly1, Poly2, Poly3);

printf("相乘后多项式3："); DispPoly(Poly3);

DestroyPoly(Poly1);

DestroyPoly(Poly2);

DestroyPoly(Poly3);

return 1;

}

一键复制

编辑

Web IDE

原始数据

按行查看

历史