链表的应用--多项式相加

#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;
}

void printList(LinkList paraHeader){
	NodePtr p = paraHeader->next;
	while (p != NULL) {
    if(p->next != NULL)
		    printf("%d * 10^%d + ", p->coefficient, p->exponent);
    else
      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;

	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;
	printNode(p, 'p');
	q = paraList2->next;
	printNode(q, 'q');
	r = paraList1; 
	printNode(r, 'r');
	free(paraList2);//指控第二个链表的头结点 

	while ((p != NULL) && (q != NULL)) {//通过使用p，q指向两个多项式的头结点，使用if语句进行插入和删除达到目的
		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');
			}
			s = q;
			q = q->next;
      if(q!=NULL){
			printf("q is pointing to (%d, %d)\r\n", q->coefficient, q->exponent);
      }
			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(){
	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");
}

int main(){
	additionTest1();
	additionTest2();
	printf("Finish.\r\n");
  system("pause");
	return 0;
}

第一个测试样例的结果

第二个测试样例的结果

 

 学习了这个应用后，我对于链表的可能的应用有了更多的期待，同时也加深了我对于指针的理解。随着更多数据结构的学习，我相信能够办到的事情会越来越多。