一元稀疏多项式的解决办法？

[hechaonan]

要求用单链表解决。

[yatuor]

本来就是应该用单链表解决的,节点中包括系数,次数就行了.

[cutestar]

本人前几天才做完有关单链表和双链表的练习。自己做一做就知道了！！！

UP AND DOWN

[azuretttc]

struct node
{int exp;
int ceof;
struct node * link;
};
typedef struct node NODE;

[skyling2001]

#include <stdio.h>
#include <malloc.h>
#include <string.h>

typedef struct pnode
{
float coef;
int exp;
struct pnode *next;
}polynode;

polynode *creatnode()
{
float newcoef;
int newexp,k=0,h;

polynode *head,*s,*rear;
head=(struct pnode *)malloc(sizeof(polynode));

rear=head;
printf("length=");
scanf("%d",&h);

k=0;
while(k<h)
{
printf("xishu",k+1);
scanf("%f",&newcoef);
printf("zhishu",k+1);
scanf("%d",&newexp);
s=(struct pnode *)malloc(sizeof(polynode));
s->coef=newcoef;
s->exp=newexp;
// printf("%s->",s->coef);
rear->next=s;
rear=s;
printf("***************************************\n");

k++;
}
// printf("%d\n",&rear);
rear->next=head;
// printf("%d\n",&rear->next);
return (head);
}
然后在main中调用