数据结构（3）：一元多项式的基本操作

#include<stdio.h>
#include<stdlib.h>
#define Status int
#define OVERFLOW -1
#define ERROR -2
#define OK 1
typedef struct {
         // 项的表示
	float  coef;          // 系数
	int   expn;           // 指数
} term, ElemType;

typedef struct LNode{
   
	ElemType data;
	struct LNode *next;
}*LinkList;

typedef LinkList polynomial;
//1.初始化
Status InitPolyn(polynomial &P){
   
	P = (polynomial)malloc(sizeof(LNode));
	if (!P)
	{
   
		exit(OVERFLOW);
	}
	P->next = NULL;
	return OK;
}

//2.销毁链表
Status DestoryPolyn(polynomial &P){
   
	polynomial p;
	while (P->next)
	{
   
		p = P->next;
		P->next = p->next;
		free(p);
	}
	return OK;
}

Status ClearPolyn(polynomial &P){
   
	polynomial p = P->next;
	polynomial s;
	while (p)
	{
   
		s = p;
		p = p->next;
		free(s);
	}
	return OK;
}

//3.判断链表是否为空
bool PolynEmpty(polynomial P){
   
	if (P->next){
   
		return true;
	}
	else
	{
   
		return false;
	}
}

//4.求链表的长度
Status PolynLength(polynomial P){
   
	int j = 0;
	polynomial p = P;
	while (p->next!=NULL)
	{
   
		j++;
		p = p->next;
	}
	return j;
}