河南理工大学数据结构期末上机考试参考代码

#define null 0
#include "stdio.h"
#include "stdlib.h"
#include "math.h"
typedef struct
{float coef;
 int expn;
}term;
typedef  int status;
typedef struct Lnode
{
term data;
struct Lnode *next;}*Link,*Linklist;

int cmp(term a,term b)
{if (a.expn==b.expn) return 0;
 else return (a.expn-b.expn)/abs(a.expn-b.expn);
}

void Orderinsert(Linklist &L,term e,int (*comp)(term,term))
{Link o,p,q;
q=L;
p=q->next;
while (p&&comp(p->data,e)<0)
{q=p;p=p->next;}
o=(Link)malloc(sizeof(Lnode));
o->data=e;
q->next=o;
o->next=p;
}

status LocateElem(Linklist L,term e,Link &s,Link &q,int (*comp)(term,term))
{Link p;s=L;
 p=s->next;
while (p&&comp(p->data,e)!=0)
{s=p;p=p->next;}
if(!p) {s=q=null;return 0;}
else {q=p;return 1;}
}

void Delnext(Linklist &L,Link s)
{Link q=s->next;
 s->next=q->next;
 free(q);
}

void Orderinsertmerge(Linklist &L,term e,int (*compara)(term,term))
{Link q,s;
if (LocateElem(L,e,s,q,compara))
{
	q->data.coef+=e.coef;
	if (!q->data.coef)
	{
	 Delnext(L,s);
    }
}
else  Orderinsert(L,e,compara);
}

void Creatpolyn (Linklist &p,int m)
{term e;
 int i;
 p=(Link)malloc(sizeof(Lnode));p->next=null;
 printf("\n请输入%d个系数和指数用空格符间隔：\n",m);
 for(i=1;i<=m;i++)
 {scanf("%f%d",&e.coef,&e.expn);
  Orderinsertmerge(p,e,cmp);}}

void add(Linklist &La,Linklist Lb)//请将该函数改成void add(Linklist La,Linklist Lb,Linklist &Lc),实现Lc= La*Lb
{Link qb;term b;
 qb=Lb->next;
 while(qb)
 {
	 b=qb->data;
	 Orderinsertmerge(La,b,cmp);
	 qb=qb->next;
 }
 //销毁链表Lb
}

void printpolyn(Linklist p)
{Link q;
q=p->next;
printf("    系数    指数\n");
while(q)
{printf("%8.2f  %-d\n",q->data.coef,q->data.expn);
 q=q->next;
}
}

//请在此处写上将一元多项式横向输出的函数

int main()
{int x;
Linklist L1,L2;
printf("\n请输入第一个一元多项式的项数:");
scanf("%d",&x);
Creatpolyn(L1,x);
printpolyn(L1);

printf("\n请输入第二个一元多项式的项数:");
scanf("%d",&x);
Creatpolyn(L2,x);
printpolyn(L2);

add(L1,L2);
printf("\n相加以后的一元多项式为：\n");
printpolyn(L1);

}