【C语言链表练习】关于多项式的相加，寻找项，删除项，添加项。

【C语言】多项式相加、寻找项、删除项、添加项。

#include <stdio.h>
#include <string.h>
#include <stdlib.h>

//typedef struct node* Node;
typedef struct node{  
	int coe;
	int power;
	struct node *next;
} Node;

//用以创建连表时，指向链表最后一项 
Node* tail = NULL;
 
void freeList( Node* head );
Node *Link(Node *head,int coe,int power);
void printList(Node* head);
void findPower(int targetPower,Node *head);
Node *deleteNode(int targetPower,Node *head);
Node *addNode(int addPower,int addCoe,Node* head);

int main()
{
	int coe,power;
	Node* head1 = NULL;
	Node* head2 = NULL;
	//输入第一个多项式 
	do{
		scanf("%d",&power);
		scanf("%d",&coe);
		if( coe == 0 && power == 0 )
		{
			head1 = Link( head1 , 0 , 0 );
		}
		if( coe != 0 )
		{
			head1 = Link( head1 , coe , power );
		}
	}while( power != 0 );
	tail = NULL;

	//输入第二个多项式 
	do{
		scanf("%d",&power);
		scanf("%d",&coe);
		if( coe == 0 && power == 0 )
		{
			head2 = Link( head2 , 0 , 0 );
		}
		if( coe != 0 )
		{
			head2 = Link( head2 , coe , power );
		}
	}while( power != 0 );
	tail = NULL;
		
	printList( head1 );
	printList( head2 );

	freeList( head1 );
	freeList( head2 );
	return 0;
} 

//释放链表内存 
void freeList( Node* head )
{
	Node* p1 = head;
	Node* p2 = NULL;
	free( p1 );
	p1 = NULL;
	if( !p2 ) freeList(p2);
}

//创建多项式链表，coe为系数，power为幂级数 
Node *Link(Node *head,int coe,int power)
{
	
	Node* p = (Node*)malloc(sizeof(node));
	p->coe = coe;
	p->power = power;
	p->next = NULL;
	if( head == NULL )
	{
		head = p;
		tail = head;
	}
	else
	{
		tail->next = p;			
		tail = tail->next;
	}
	return head;
}

//打印链表 
void printList(Node* head)
{ 
	for( Node* r = head ; r ; r = r->next )
	{
		printf("%dx%d",r->coe,r->power);
		if( !r->next ) printf("\n");
		else printf("+");
	}
}

//寻找多项式中是否有某一幂级数 
void findPower(int targetPower,Node *head)
{
	//当找到目标幂级数时，result为true 
	bool result = false;
	for(Node *r = head ; r ; r = r->next)
	{
		if( r->power == targetPower )
		{
			result = true;
			break;
		}
	}
	if(result) printf("找到了\n");
	else printf("没找到\n"); 
}

//删除多项式中的目标幂级数 
Node* deleteNode( int targetPower,Node *head )
{
	Node *r2 = NULL;
	for( Node *r = head ; r ; r2 = r , r = r->next )
	{
		if( r->power == targetPower )
		{
			if( r2 ) r2->next = r->next;
			else head = head->next;
			break;
		}
	}
	return head;
}

//在多项式中添加一项
Node* addNode(int addPower,int addCoe,Node* head)
{
	//创造一个新节点newnode用来存储添加项的系数和幂级数 
	Node* newnode = (Node*)malloc(sizeof(Node));
	newnode->power = addPower;
	newnode->coe = addCoe;
	newnode->next = NULL; 
	Node *r2 = NULL;
	//r用以遍历链表，r2用以指向r的前一项 
	for(Node *r = head ; r ; r2 = r , r = r->next)
	{
		//当在多项式中找到比添加项幂级数低的幂级数时，将newnode插入r前一节 
		if( r->power < newnode->power )
		{
			//当r为第一项时，newnode改为第一项 
			if( r2 )
			{
				r2->next = newnode;
				newnode->next = r;
			}
			else
			{
				head = newnode;
				newnode->next = r;
			}
			break;
		}
		//当添加项的幂级数在多项式中存在时，系数相加 
		else if( r->power == newnode->power )
		{
			r->coe = r->coe + newnode->coe;
			free(newnode);
			break;
		}
	} 
	return head;
}