#include<stdio.h>
#include<stdlib.h>
int cmp(struct term a,struct term b);
struct linklist initlist(struct linklist L);
struct linklist creatpolyn(struct linklist L,int m);
struct term * makenode(oat c,int e);
struct linklist insrst(struct linklist L,struct term *s);
int locate(struct linklist L,int e);
struct term * nextops(struct term *p);
struct term * delnode(struct term *p,struct term *q);
struct linklist addpolyn(struct linklist pa,struct linklist pb);
struct term* gethead(struct linklist L);
int listempty(struct linklist L);
void append(struct linklist L,struct term * s);
void print(struct linklist L);$$$$$$$$$$$$$$$$$$$$$$$$$ //一干函数声明
struct term
{
oat coef; //系数
int expn;$$ //指数
struct term * next;
};
struct linklist
{
struct term * head;
};
int main(void)$$$$$$$$$ //主函数
{
struct linklist Pa,Pb;
int ma,mb;
printf("输入两个多项式的项数");
scanf("%d %d",&ma,&mb);
Pa=creatpolyn(Pa,ma);
print(Pa);
Pb=creatpolyn(Pb,mb);
print(Pb);
Pa=addpolyn(Pa,Pb);
printf("结果为:");
print(Pa);
$$$ return 0;
}
struct term* gethead(struct linklist L)$$$$$$$$ //取头结点
{
return L.head;
}