结构体定义
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("\r\n");
}
节点打印
void printNode(NodePtr paraPtr, char paraChar) {
if (paraPtr == NULL) {
printf("NULL\r\n");
} else {
printf("The element of %c is (%d * 10^%d)\r\n", paraChar, paraPtr->coefficient, paraPtr->exponent);
}
}
元素添加
void appendElement(LinkList paraHeader, int paraCoefficient, int paraExponent) {
NodePtr p, q;
//申请
//creat new node
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;
// s指针用来删除的
//r指针用来连接完善paraList的
p = paraList1->next;
printNode(p, 'p');
q = paraList2->next;
printNode(q, 'q');
r = paraList1;
printNode(r, 'r');
free(paraList2);
// situation
while ((p != NULL) && (q != NULL)) {
//二者指数如果不相等
if (p->exponent < q->exponent) {
printf("case 1\r\n");
r->next = p;
r = p;
printNode(r, 'r');
p = p->next;
printNode(p, 'p');
//r连接p p往后移 q不动 知道遇到p的exponent 》= q的exponent 。
}
// p 》 q
else if ((p->exponent > q->exponent)) {
printf("case 2\r\n");
r->next = q;
r = q;
//把p串起来
printNode(r, 'r');
//q后移
q = q->next;
printNode(q, 'q');
}
//若二者指数相等
else {
printf("case 3\r\n");
p->coefficient = p->coefficient + q->coefficient;
//合二为一给p吧
printf("The coefficient is: %d.\r\n", p->coefficient);
// 如果系数和为0 自然可以删除这一节点了
if (p->coefficient == 0) {
printf("case 3.1\r\n");
s = p;
p = p->next;
printNode(p, 'p');
// free(s);
} else //若系数不为0 就p赋值给r p指针往后移
{
printf("case 3.2\r\n");
r = p;
printNode(r, 'r');
p = p->next;
printNode(p, 'p');
}
s = q;
//q两种情况都要往后面移
q = q->next;
free(s);
}
printf("p = %ld, q = %ld \r\n", p, q);
}
printf("End of while.\r\n");
if (p == NULL) {
r->next = q;
} else {
r->next = p;
}
printf("Addition ends.\r\n");
}
测试用例
void additionTest1() {
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, 8);
printList(tempList2);
add(tempList1, tempList2);
printf("The result is: ");
printList(tempList1);
printf("\r\n");
}
void additionTest2() {
// Step 1. Initialize the first polynomial.
LinkList tempList1 = initLinkList();
appendElement(tempList1, 7, 0);
appendElement(tempList1, 3, 1);
appendElement(tempList1, 9, 8);
appendElement(tempList1, 5, 17);
printList(tempList1);
// Step 2. Initialize the second polynomial.
LinkList tempList2 = initLinkList();
appendElement(tempList2, 8, 1);
appendElement(tempList2, 22, 7);
appendElement(tempList2, -9, 10);
printList(tempList2);
// Step 3. Add them to the first.
add(tempList1, tempList2);
printf("The result is: ");
printList(tempList1);
printf("\r\n");
}
int main() {
additionTest1();
additionTest2();
printf("Finish.\r\n");
return 0;
}
运行