給出兩個多項式:
![](https://img.laitimes.com/img/9ZDMuAjOiMmIsIjOiQnIsIyZuBnLi9VMhVTZhZDNhJmZxIGN3AjYyIzY5ADOmJWMkRDMkFjY00iM29CXt92YucWbphmeuIzYpB3Lc9CX6MHc0RHaiojIsJye.png)
#include<stdio.h>
#define F1_LENGTH 3
#define F2_LENGTH 3
struct Node
{
int coef;
int expon;
};
struct Node f1_nodes[3];
struct Node f2_nodes[3];
void main(){
f1_nodes[0].coef = 3;
f1_nodes[0].expon = 4;
f1_nodes[1].coef = 4;
f1_nodes[1].expon = 2;
f1_nodes[2].coef = 1;
f1_nodes[2].expon = 0;
f2_nodes[0].coef = 5;
f2_nodes[0].expon = 3;
f2_nodes[1].coef = 4;
f2_nodes[1].expon = 2;
f2_nodes[2].coef = 8;
f2_nodes[2].expon = 0;
size_t i = 0, j = 0;
for (; i < F1_LENGTH && j < F2_LENGTH;)
{
if (f1_nodes[i].expon > f2_nodes[j].expon){
printf("(%d,%d) ", f1_nodes[i].coef, f1_nodes[i].expon);
i++;
}else if (f1_nodes[i].expon < f2_nodes[j].expon){
printf("(%d,%d) ", f2_nodes[j].coef, f2_nodes[j].expon);
j++;
}else
{
printf("(%d,%d) ", f1_nodes[i].coef+f2_nodes[j].coef, f2_nodes[j].expon);
i++;
j++;
}
}
while (i<F1_LENGTH)
{
printf("(%d,%d) ", f1_nodes[i].coef, f1_nodes[i].expon);
i++;
}
while (j<F2_LENGTH)
{
printf("(%d,%d) ", f2_nodes[j].coef, f2_nodes[j].expon);
j++;
}
getchar();
}
通過上面的方式即可完成多項式的計算,但是上面的方式依然不是特别好,因為數組的大小是固定的,沒辦法動态改變,接下來我們使用連結清單的方式來存儲非零項,定義如下資料類型:
typedef struct Node *PolyLink;
struct Node
{
int coef;
int expon;
PolyLink link;
};
f1和f2連結清單存儲形式為:
C語言實作如下:
#include<stdio.h>
#include <malloc.h>
typedef struct Node *PolyLink;
struct Node
{
int coef;
int expon;
PolyLink link;
};
void main(){
PolyLink p,p1;
PolyLink head1 = (PolyLink)malloc(sizeof(struct Node));
p = head1;
p->coef = 3;
p->expon = 4;
p->link = (PolyLink)malloc(sizeof(struct Node));
p = p->link;
p->coef = 4;
p->expon = 2;
p->link = (PolyLink)malloc(sizeof(struct Node));
p = p->link;
p->coef = 1;
p->expon = 0;
p->link = NULL;
PolyLink head2 = (PolyLink)malloc(sizeof(struct Node));
p = head2;
p->coef = 5;
p->expon = 3;
p->link = (PolyLink)malloc(sizeof(struct Node));
p = p->link;
p->coef = 4;
p->expon = 2;
p->link = (PolyLink)malloc(sizeof(struct Node));
p = p->link;
p->coef = 8;
p->expon = 0;
p->link = NULL;
while(head1 != NULL && head2 != NULL){
if (head1->expon > head2->expon){
printf("(%d,%d) ", head1->coef, head1->expon);
p1 = head1;
head1 = head1->link;
free(p1);
}
else if (head1->expon < head2->expon){
printf("(%d,%d) ", head2->coef, head2->expon);
p1 = head2;
head2 = head2->link;
free(p1);
}
else{
printf("(%d,%d) ", head1->coef+head2->coef, head2->expon);
p1 = head1;
head1 = head1->link;
free(p1);
p1 = head2;
head2 = head2->link;
free(p1);
}
}
while (head1 != NULL){
printf("(%d,%d) ", head1->coef, head1->expon);
p1 = head1;
head1 = head1->link;
free(p1);
}
while (head2 != NULL){
printf("(%d,%d) ", head2->coef, head2->expon);
p1 = head2;
head2 = head2->link;
free(p1);
}
getchar();
}
今天的分享就到這裡,下一篇繼續分析。如果大家覺得還可以呀,記得推薦呦。
歡迎大家支援我公衆号:
從多項式相加看線性結構
本文章屬于原創作品,歡迎大家轉載分享,禁止修改文章的内容。尊重原創,轉載請注明來自:七夜的故事 http://www.cnblogs.com/qiyeboy/