链表实现多项式相加

最新推荐文章于 2022-03-16 20:11:05 发布

qq_40100246

最新推荐文章于 2022-03-16 20:11:05 发布

阅读量305

点赞数

CC 4.0 BY-SA版权

分类专栏： DS 文章标签：链表

本文链接：https://blog.youkuaiyun.com/qq_40100246/article/details/90316776

DS 专栏收录该内容

0 篇文章

订阅专栏

博客给出了链表多项式相加的核心代码，包含相加函数Add和打印函数Print。Add函数实现两个多项式相加，根据指数大小处理节点；Print函数用于打印多项式。代码中还涉及内存分配和节点操作等内容。

以下为核心代码。转载请联系作者（即本人）
//相加
Polynomial Add(Polynomial a, Polynomial b)
{
PtrToNode s, aa, bb, head, rear;
int expon, coef;
head = (PtrToNode)malloc(sizeof(struct Node));
rear = head;
aa = a->Next; bb = b->Next;
while (aa&&bb) {
s = (PtrToNode)malloc(sizeof(struct Node));
if (aa->Exponent == bb->Exponent) {
if (aa->Exponent == 0) {
return (head);
}
else {
expon = aa->Exponent;
coef = aa->Coefficient + bb->Coefficient;
aa = aa->Next;
bb = bb->Next;
}
}
else if (aa->Exponent > bb->Exponent) {
expon = aa->Exponent;
coef = aa->Coefficient;
aa = aa->Next;
}
else {
expon = bb->Exponent;
coef = bb->Coefficient;
bb = bb->Next;
}
if (coef) {
s->Coefficient = coef;
s->Exponent = expon;
rear->Next = s;
rear = s;
s = s->Next;
}
else;
}
if (aa) {
rear->Next = aa;
}
else {
rear->Next = bb;
}
return head;
}
void Print(Polynomial p)
{
PtrToNode ptr;
int flag = 0;
ptr = p->Next;//因为刚开始是空指针
while (ptr) {
if (flag) {
printf(" “);
}
else {
flag = 1;
}
printf(”%d %d", ptr->Coefficient, ptr->Exponent);
ptr = ptr->Next;
}
}
//这里是scanf_s