professor's code:
#include <stdio.h>
#include <malloc.h>
/**
* Linked list of integers. The key is data. The key is sorted in non-descending order.
*/
typedef struct LinkNode{
int coefficient;
int exponent;
struct LinkNode *next;
} *LinkList, *NodePtr;
/**
* Initialize the list with a header.
* @return The pointer to the header.
*/
LinkList initLinkList(){
LinkList tempHeader = (LinkList)malloc(sizeof(struct LinkNode));
tempHeader->coefficient = 0;
tempHeader->exponent = 0;
tempHeader->next = NULL;
return tempHeader;
}// Of initLinkList
/**
* Print the list.
* @param paraHeader The header of the list.
*/
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
/**
* Print one node for testing.
* @param paraPtr The pointer to the node.
* @param paraChar The name of the node.
*/
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
/**
* Add an element to the tail.
* @param paraCoefficient The coefficient of the new element.
* @param paraExponent The exponent of the new element.
*/
void appendElement(LinkList paraHeader, int paraCoefficient, int paraExponent){
NodePtr p, q;
// Step 1. Construct a new node.
q = (NodePtr)malloc(sizeof(struct LinkNode));
q->coefficient = paraCoefficient;
q->exponent = paraExponent;
q->next = NULL;
// Step 2. Search to the tail.
p = paraHeader;
while (p->next != NULL) {
p = p->next;
}// Of while
// Step 3. Now add/link.
p->next = q;
}// Of appendElement
/**
* Polynomial addition.
* @param paraList1 The first list.
* @param paraList2 The second list.
*/
void add(NodePtr paraList1, NodePtr paraList2){
NodePtr p, q, r, s;
// Step 1. Search to the position.
p = paraList1->next;
printNode(p, 'p');
q = paraList2->next;
printNode(q, 'q');
r = paraList1; // Previous pointer for inserting.
printNode(r, 'r');
free(paraList2); // The second list is destroyed.
while ((p != NULL) && (q != NULL)) {
if (p->exponent < q->exponent) {
//Link the current node of the first list.
printf("case 1\r\n");
r = p;
printNode(r, 'r');
p = p->next;
printNode(p, 'p');
} else if ((p->exponent > q->exponent)) {
//Link the current node of the second list.
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");
//Change the current node of the first list.
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');
// free(s);
} 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;
//printf("q is pointing to (%d, %d)\r\n", q->coefficient, q->exponent);
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
/**
* Unit test.
*/
void additionTest(){
// 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, 8);
printList(tempList2);
// Step 3. Add them to the first.
add(tempList1, tempList2);
printList(tempList1);
}// Of additionTest
/**
* The entrance.
*/
void main(){
additionTest();
printf("Finish.\r\n");
}// Of main
my code:
#include<stdio.h>
#include<malloc.h>
typedef struct linknode
{
int coef;//系数
int expn;//指数
struct linknode* next;//指针域
}node, * nodeptr;
nodeptr creat_list()
{
nodeptr phead = (nodeptr)malloc(sizeof(node));
phead->coef = 0;
phead->expn = -1;
phead->next = NULL;
return phead;
}
void print_list(nodeptr phead)
{
nodeptr p = phead->next;
while (p->next != NULL)
{
printf("%d * 10^%d + ", p->coef, p->expn);
p = p->next;
}
printf("%d * 10^%d\n", p->coef, p->expn);
}
void append(nodeptr phead, int coe, int exp)
{
nodeptr q = (nodeptr)malloc(sizeof(node));
q->coef = coe;
q->expn = exp;
q->next = NULL;
nodeptr p = phead;
while (p->next != NULL)
{
p = p->next;
}
p->next = q;
}
void add(nodeptr phead1, nodeptr phead2)
{
nodeptr p1 = phead1->next;
nodeptr p2 = phead2->next;
while (p1 != NULL)
{
int flag = 0; nodeptr A;
nodeptr P2 = p2;
while (P2 != NULL)
{
if (p1->expn == P2->expn)
{
P2->coef += p1->coef;
flag = 1;
}
P2 = P2->next;
}//此时P2等于NULL
P2 = phead2;
while (P2->next != NULL)
{
P2 = P2->next;
}//让P2回到最后一个位置
if (flag == 0)
{
if (p1->expn > P2->expn&&P2!=NULL)
{
P2->next = p1;
p1->next = NULL;
}
if (p1->expn < p2->expn)
{
p1->next = p2;
phead2->next = p1;
}
P2 = phead2->next;
while (P2->next != NULL)
{
if (p1->expn > P2->expn && p1->expn < P2->next->expn)
{
nodeptr q = (nodeptr)malloc(sizeof(node));//重新建立一个与p1数据相同的结点,否则第一个链表会变化
if (q != NULL)
{
q->expn = p1->expn; q->coef = p1->coef;
q->next = P2->next;
P2->next = q;
/*P2 = P2->next;*/
}
}
P2 = P2->next;
}
}
p1 = p1->next;
}
}
int main()
{
nodeptr phead1 = creat_list();
append(phead1, 3, 10);
append(phead1, 5, 12);
append(phead1, 8, 13);
print_list(phead1);
nodeptr phead2 = creat_list();
append(phead2, 5, 8);
append(phead2, 6, 14);
append(phead2, 2, 18);
print_list(phead2);
add(phead1, phead2);
print_list(phead2);
return 0;
}