总代码:
#include<stdio.h>
#include<stdlib.h>
typedef struct LinkNode{
int coefficient;
int exponent;
struct LinkNode *next;
} *LinkList, *NodePtr;
/**
*创建有头结点的链表
*/
LinkList initLinkList(){
LinkList tempHeader = (LinkList)malloc(sizeof(struct LinkNode));
tempHeader->coefficient = 0;
tempHeader->exponent = 0;
tempHeader->next = NULL;
return tempHeader;
}
/**
*输出链表
*/
void printList(LinkList paraHeader){
NodePtr p = paraHeader->next;
while (p != NULL) {
printf("%d * 10^%d + ", p->coefficient, p->exponent);
p = p->next;
}
printf("\n");
}
/**
*加入一个元素到尾部
*/
void appendElement(LinkList paraHeader, int paraCoefficient, int paraExponent){
NodePtr p, q;
q = (NodePtr)malloc(sizeof(struct LinkNode));
q->coefficient = paraCoefficient;
q->exponent = paraExponent;
q->next = NULL;
p = paraHeader;
while (p->next != NULL) {
p = p->next;
}
p->next = q;
}
/**
*多项式加法
*/
void add(NodePtr paraList1, NodePtr paraList2){
NodePtr p, q, r, s;
p = paraList1->next;
q = paraList2->next;
r = paraList1;
free(paraList2);
while ((p != NULL) && (q != NULL)) {
if (p->exponent < q->exponent) {
r->next = p;
r = p;
p = p->next;
} else if (p->exponent > q->exponent) {
r->next = q;
r = q;
q = q->next;
} else {
p->coefficient = p->coefficient + q->coefficient;
printf("The coefficient is: %d\n", p->coefficient);
if (p->coefficient == 0) {
s = p;
p = p->next;
free(s);
} else {
r->next = p;
r = p;
p = p->next;
}
s = q;
q = q->next;
free(s);
}
printf("End of while\n");
}
if (p == NULL) {
r->next = q;
} else if (q == NULL) {
r->next = p;
}
printf("Addition ends.\n");
}
/**
*测试
*/
void additionTest(){
LinkList tempList1 = initLinkList();
appendElement(tempList1, 7, 0);
appendElement(tempList1, 3, 1);
appendElement(tempList1, 9, 8);
appendElement(tempList1, 5, 17);
printList(tempList1);
LinkList tempList2 = initLinkList();
appendElement(tempList2, 8, 1);
appendElement(tempList2, 22, 7);
appendElement(tempList2, 9, 10);
printList(tempList2);
add(tempList1, tempList2);
printList(tempList1);
}
int main() {
additionTest();
printf("Finish.\n");
return 0;
}
其中核心的代码:
void add(NodePtr paraList1, NodePtr paraList2){
NodePtr p, q, r, s;
p = paraList1->next;
q = paraList2->next;
r = paraList1;
free(paraList2);
while ((p != NULL) && (q != NULL)) {
if (p->exponent < q->exponent) {
r->next = p;
r = p;
p = p->next;
} else if (p->exponent > q->exponent) {
r->next = q;
r = q;
q = q->next;
} else {
p->coefficient = p->coefficient + q->coefficient;
printf("The coefficient is: %d\n", p->coefficient);
if (p->coefficient == 0) {
s = p;
p = p->next;
free(s);
} else {
r->next = p;
r = p;
p = p->next;
}
s = q;
q = q->next;
free(s);
}
printf("End of while\n");
}
if (p == NULL) {
r->next = q;
} else if (q == NULL) {
r->next = p;
}
printf("Addition ends.\n");
}
运行结果: