用链表实现一元多项式相加.docVIP

typedef struct { float coef; int expn; }term,ElemType; typedef struct LNode{ ElemType data; struct LNode *next; }LNode,*LinkList; typedef LinkList polynomial; Status InitList(LinkList L){ L=(LinkList)malloc(sizeof(LNode)); if(!L) return ERROR; L-data.coef=0.0; L-data.expn=-1; L-next=NULL; return OK; } LinkList GetHead(LinkList L){ return L; } void SetCurElem(LNode* NodeAdd,ElemType e){ NodeAdd-data.coef=e.coef; NodeAdd-data.expn=e.expn; } Status cmp(ElemType a,ElemType b){ if(a.expnb.expn)return -1; if(a.expn==b.expn)return 0; return 1; } Status MakeNode(LNode* n,ElemType e){ n=(LNode*)malloc(sizeof(LNode)); if(!n) return ERROR; SetCurElem(n,e); n-next=NULL; return OK; } void InsFirst(LinkList InsertAdd,LNode* n){ n-next=InsertAdd-next; InsertAdd-next=n; } Status DelFirst(LinkList L,LNode* q){ if(L-next==NULL) return ERROR; q=L-next; L-next=L-next-next; return OK; } Status LocateElem(LinkList L,ElemType e,LinkList q,int (*cmpare)(ElemType ,ElemType)){//the var q is a position LinkList BefAddCurNode; BefAddCurNode=L; while(L-next){ BefAddCurNode=L; L=L-next; int result=cmpare(L-data,e); if(result==0){ q=L; return true; } if(result==1){ q=BefAddCurNode; return false; } BefAddCurNode=L; } q=BefAddCurNode; return false; } LinkList NextPos(LinkList List,LinkList ListHead){ while(List){ if(List==ListHead) return List-next; List=List-next; } return NULL; } ElemType GetCurElem(LinkList NodeAdd){ return NodeAdd-data; } Status ListEmpty(LinkList list){ if(list-next==NULL) return true; return false; } Status Append(polynomial Polyn,LinkList NodeAdd){ if(NodeAdd==NULL)return ERROR; LinkList head=Polyn; while(head-next){ head=he