数据结构(多项式相加)
1.学习收获
本节课类似于习题课,讲了单链表的一个应用——多项式相加问题,对于这个问题呢,思路就是把每项的系数和指数分开存储,放在同一个结构体变量里,再用指针把其串起来,形成一个简易的多项式,再通过一系列操作把两个多项式相加起来。
既然是应用,那就肯定离底层远一些,更偏向于对代码能力和实操的考验,课堂上面内容并未讲完,但是大致的思路其实已经明了,对于这种不是那么抽象的东西,我觉得更应该掌握好,不仅仅是coding能力,还有算法的设计能力,两者相得益彰,只有拥有完整的两项能力,才能够更好地完成各种算法题目的解答。
2.代码如下:
#define _CRT_SECURE_NO_WARNINGS 1
#include <stdio.h>
#include <malloc.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;
}// Of initLinkList
/*
遍历输出链表
*/
void printList(LinkList paraHeader) {
NodePtr p = paraHeader->next;
while (p != NULL) {
printf("%d * 10^%d + ", p->coefficient, p->exponent);
p = p->next;
}// Of while
printf("\r\n");
}// Of printList
/*
闵帆老师的测试代码
*/
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);
}// Of while
}// Of printNode
/**
在末尾添加节点
*/
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;
}// Of while
p->next = q;
}// Of appendElement
/*
将两个多项式相加
*/
void add(NodePtr paraList1, NodePtr paraList2) {
NodePtr p, q, r, s;
// 找相加的位置
p = paraList1->next;
printNode(p, 'p');
q = paraList2->next;
printNode(q, 'q');
r = paraList1;
printNode(r, 'r');
free(paraList2);
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');
}
else if ((p->exponent > q->exponent)) {
//连接第二个节点
printf("case 2\r\n");
r->next = q;
r = q;
printNode(r, 'r');
q = q->next;
printNode(q, 'q');
}
else {
printf("case 3\r\n");
p->coefficient = p->coefficient + q->coefficient;
printf("The coefficient is: %d.\r\n", p->coefficient);
if (p->coefficient == 0) {
printf("case 3.1\r\n");
s = p;
p = p->next;
printNode(p, 'p');
}
else {
printf("case 3.2\r\n");
r = p;
printNode(r, 'r');
p = p->next;
printNode(p, 'p');
}// Of if
s = q;
q = q->next;
free(s);
}// Of if
printf("p = %ld, q = %ld \r\n", p, q);
} // Of while
printf("End of while.\r\n");
if (p == NULL) {
r->next = q;
}
else {
r->next = p;
} // Of if
printf("Addition ends.\r\n");
}// Of add
/**
测试代码Ⅰ
*/
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");
}// Of additionTest1
/**
测试代码Ⅱ
*/
void additionTest2() {
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);
printf("The result is: ");
printList(tempList1);
printf("\r\n");
}// Of additionTest2
int main() {
additionTest1();
additionTest2();
return 0;
}// Of main