考研数据结构与算法之单链表多项式的计算（二）

    花了好大的功夫终于折腾完了，首先是本人确实是一只小菜鸟，折腾来折腾去总是搞得不合适。这次又重新定义了数据类型，之前由于ElemType传递的不是地址以至于没法进行操作被卡住了。然后还有一直阻挠我的一件事就是在做加法的时候如果直接把第二个链表插入到第一个中去确实逻辑非常复杂，以我这种脑子实现起来有点困难。虽然查了不少资料看到他们都是新建一个链表但是我当时固执的不愿意采用，今晚突然醒悟到即使重新创建一个链表也不会改变时间复杂度于是我就释然了。

    但是，乘法要实现起来仍然比较麻烦，因此留到明天专门解决，另外在我的VS里面好像出了点问题没法使用free了，因此就没有对资源进行删除，不过函数都写好了应该是没有问题的。

#include <stdio.h>
#include <stdlib.h> 
#define OK 1
#define ERROR 0
#define TRUE 1
#define FALSE 0
typedef int Status;
typedef struct Term
{
	int coef;		// 系数
	int expn;		// 指数
	struct Term *next;
} *PolynList;
// 创建一段多项式
Status CreatePolyn(PolynList *P, int n);
// 根据需要输入多项式
Status PressPolyn(PolynList *P);
// 销毁多项式
Status DestroyPolyn(PolynList *P);
// 显示多项式
Status PrintPolyn(PolynList P);
// 获取链表长度
int PolynLength(PolynList P);
// 多项式相加
PolynList AddPolyn(PolynList PA, PolynList PB);
// 多项式相剪
PolynList SubPolyn(PolynList PA, PolynList PB);
// 多项式相乘
Status MutPolyn(PolynList *PA, PolynList *PB);
int num[10][2] ={1, 23,
					2, 1,
					4, 6,
					5, 1,
					9, 100,
					11, 1,
					12, 1,
					13, 2,
					18, 1,
					45, 2};
int main(void)
{
	PolynList m,n;
	CreatePolyn(&m, 2);
	PressPolyn(&n);
	PrintPolyn(m);
	PrintPolyn(n);
	PrintPolyn(AddPolyn(m,n));
	//DestroyPolyn(&n);
	printf("%d", n->coef);
	system("pause");
}
Status CreatePolyn(PolynList *P, int n)
{
	if( n < 1 )
		return ERROR;
	(*P) = (PolynList)malloc(sizeof(PolynList));
	(*P)->expn = 0-n;
	PolynList q = (*P);
	int i = 0;
	while(i<n)
	{
		q->next = (PolynList)malloc(sizeof(PolynList));
		q = q->next;
		q->coef = num[i][1];
		q->expn = num[i][0];
		i++;
	}
	q->next = NULL;
	return OK;
}
Status PressPolyn(PolynList *P)
{
	int num = 0, coef = 0;
	int i;
	(*P) = (PolynList)malloc(sizeof(PolynList));
	PolynList q = (*P);
	printf("*******************************************************************************\n");
	printf("* 请输入你需要多项式的长度:\n* ");
	scanf("%d", &num);
	for(i=0; i<num; i++)
	{
		printf("* ");
		scanf("%d",&coef);
		if( coef != 0 )
		{
			q->next = (PolynList)malloc(sizeof(PolynList));
			q = q->next;
			q->coef = coef;
			q->expn = i;
		}
	}
	q->next = NULL;
	if(!(*P)->next)
		return ERROR;
	printf("* 多项式创建成功");
	printf("*******************************************************************************\n");
	return OK;
}
Status PrintPolyn(PolynList P)
{
	PolynList q;
	if(!P->next)
		return ERROR;
	q = P->next;
	printf("*******************************************************************************\n");
	printf("* 该多项式为:");
	while(q->next)
	{
		printf(" %dA%d +", q->coef, q->expn);
		q = q->next;
	}
	printf(" %dA%d;\n", q->coef, q->expn);
	printf("*******************************************************************************\n");
	return OK;
}
Status DestroyPolyn(PolynList *P)
{
	PolynList q,s;
	q = (*P)->next;
	while(q)
	{
		s = q->next;
		free(q);
		q = s;
	}
	(*P)->next = NULL;
	return OK;
}
int PolynLength(PolynList P)
{
	return -P->expn;
}
PolynList AddPolyn(PolynList PA, PolynList PB)
{
	PolynList q, s, r;
	if( (!PA->next) || (!PB->next) )
		return ERROR;
	q = PA->next;
	s = PB->next;
	PolynList PC = (PolynList)malloc(sizeof(PolynList));
	PC->expn = 0;
	r = PC;
	while( q && s )
	{
		if( q->expn == s->expn )
		{
			// 两数相加
			r->next = (PolynList)malloc(sizeof(PolynList));
			r = r->next;
			r->expn = q->expn;
			r->coef = q->coef + s->coef;
			q = q->next;
			s = s->next;
			PC->expn--;
		}else if( q->expn < s->expn )
		{
			// 将A中对应节点加入到多项式中
			r->next = (PolynList)malloc(sizeof(PolynList));
			r = r->next;
			r->expn = q->expn;
			r->coef = q->coef;
			q = q->next;
			PC->expn--;
		}else
		{
			// 将B中对应的节点加入到多项式中
			r->next = (PolynList)malloc(sizeof(PolynList));
			r = r->next;
			r->expn = s->expn;
			r->coef = s->coef;
			s = s->next;
			PC->expn--;
		}
	}
	if(s)
		q = s;
	while(q)
	{
		r->next = (PolynList)malloc(sizeof(PolynList));
		r = r->next;
		r->expn = q->expn;
		r->coef = q->coef;
		q = q->next;
		PC->expn--;
	}
	r->next = NULL;
	return PC;
}
// 相减的其实差不多只不过在插入数值的时候还要考虑正负号，其实还有一个方法就是先遍历一个多项式然后变号。
PolynList SubPolyn(PolynList PA, PolynList PB)
{
	PolynList q, s, r;
	if( (!PA->next) || (!PB->next) )
		return ERROR;
	q = PA->next;
	s = PB->next;
	PolynList PC = (PolynList)malloc(sizeof(PolynList));
	PC->expn = 0;
	r = PC;
	while( q && s )
	{
		if( q->expn == s->expn )
		{
			// 两数相加
			r->next = (PolynList)malloc(sizeof(PolynList));
			r = r->next;
			r->expn = q->expn;
			r->coef = q->coef - s->coef;
			q = q->next;
			s = s->next;
			PC->expn--;
		}else if( q->expn < s->expn )
		{
			// 将A中对应节点加入到多项式中
			r->next = (PolynList)malloc(sizeof(PolynList));
			r = r->next;
			r->expn = q->expn;
			r->coef = q->coef;
			q = q->next;
			PC->expn--;
		}else
		{
			// 将B中对应的节点加入到多项式中
			r->next = (PolynList)malloc(sizeof(PolynList));
			r = r->next;
			r->expn = s->expn;
			r->coef = -s->coef;
			s = s->next;
			PC->expn--;
		}
	}
	while(q)
	{
		r->next = (PolynList)malloc(sizeof(PolynList));
		r = r->next;
		r->expn = q->expn;
		r->coef = q->coef;
		q = q->next;
		PC->expn--;
	}
	while(s)
	{
		r->next = (PolynList)malloc(sizeof(PolynList));
		r = r->next;
		r->expn = s->expn;
		r->coef = -s->coef;
		s = s->next;
		PC->expn--;
	}
	r->next = NULL;
	return PC;
}