C语言程序：单链表实现一元多项式相加（不带头节点）

ゝ一世哀愁。 2023-08-17 16:03 91阅读 0赞

\*序：\*看了好多一元多项式的加减，基本都是带头节点的，自己不知道为什么就是喜欢不带头结点的链表，便尝试去实现了，果然（不带头的）就是麻烦。但其实思路都一样。

1.  创建两个链表La与Lb
2.  利用尾插法对两个链表进行赋值
3.  然后就到了相加的函数

直接上代码：

#include<stdio.h>
    #include<stdlib.h>
    #include<assert.h>
    
    typedef struct Node    //结构体
    { 
    	float coef;  //系数
    	int  expn;   //指数
    	struct Node* next;
    }Node,*LinkList;
    
    
    void InsertTail(LinkList* list, float c, int e)   //尾插法
    {  
    	Node* tail = *list;
    	Node* p = (Node*)malloc(sizeof(Node));
    	assert(p);
    	p->coef = c;
    	p->expn = e;
    	p->next = NULL;
    	if (*list == NULL)
    	{ 
    		*list = p;
    		return;
    	}
    	else
    	{ 
    		while (tail->next)
    		{ 
    			tail = tail->next;
    		}
    		tail->next = p;
    	}
    }
    
    void CreateList(LinkList* list, int n)  //实现单链表
    { 
    	float coef;
    	int expn;
    	int i = 1;
    	while (n--)
    	{ 
    		printf("请输入第%d数的系数和指数：",i++);
    		scanf_s("%f%d", &coef, &expn);
    		InsertTail(list, coef,expn);
    	}
    }
    
    
    LinkList AddList(LinkList La, LinkList Lb)  //相加函数
    { 
    	
    	LinkList Lc = NULL;
    	Node* pc = Lc;
    	Node* pa = La;
    	Node* pb = Lb;
    
    	while (pa&&pb)
    	{ 
    		if (pa->expn == pb->expn)
    		{ 
    			if (pa->coef + pb->coef == 0)
    			{ 
    				pa = pa->next;
    				pb = pb->next;
    				continue;
    			}
    			else
    			{ 
    				pa->coef = pa->coef + pb->coef;
    				if (Lc == NULL)
    				{ 
    					
    					Lc = pa;
    					
    				}
    				else
    				{ 
    					pc->next = pa;
    				}
    				pc = pa;
    				pa = pa->next;
    				pb = pb->next;
    				
    			}
    		}else if (pa->expn < pb->expn)
    		{ 
    			if (Lc == NULL)
    			{ 
    
    				Lc = pa;
    			}
    			else
    			{ 
    				pc->next = pa;
    			}
    			pc = pa;
    			pa = pa->next;
    		
    		}
    		else if(pa->expn > pb->expn)
    		{ 
    			if (Lc == NULL)
    			{ 
    
    				pc = pb;
    			}
    			else
    			{ 
    				pc->next = pb;
    			}
    			pc = pb;
    			pb = pb->next;
    			
    		}
    	}
    
    	if (pc != NULL)
    	{ 
    		if (pa)
    			pc->next = pa;
    		else
    			pc->next = pb;
    	}
    	else
    	{ 
    		Lc = pa ? pa : pb;
    	}
    
    	
    	return Lc;
    }
    
    
    void Print(LinkList list)    //输出函数
    { 
    	Node* p = list;
    
    	while (p->next)
    	{ 
    		printf("%.1f* X ^%d +",p->coef, p->expn);
    		p = p->next;
    	}
    	printf("%.1f* X ^%d\n", p->coef, p->expn);
    
    }
    
    int main()
    { 
    	LinkList Ax = NULL, Bx = NULL;
    	int  An, Bn;
    	printf("请输入Ax的项数：");
    	scanf_s("%d", &An);
    	CreateList(&Ax, An);
    
    	printf("Ax函数为：");
    	Print(Ax);
    	printf("请输入Bx的项数：");
    	scanf_s("%d", &Bn);
    	CreateList(&Bx, Bn);
    	printf("Bx函数为：");
    	Print(Bx);
    	/*Print(Ax);*/
    
    	LinkList Cx = AddList(Ax, Bx);
    	printf("相加后函数为：");
    	Print(Cx);
    	return 0;
    }

![cEAmzW7V4vsjJab.png][]

欢迎指教！！！

[cEAmzW7V4vsjJab.png]: https://i.loli.net/2019/09/27/cEAmzW7V4vsjJab.png