一元多项式加减乘除源代码

{
p->coef+=q->coef;
if(fabs(p->coef)>1e-6)
{
pre->next = q->next;
temp = q;
q = temp->next;
free(temp);
}
else //两项系数和为0，释放结点p和q
//函数实现
//创建多项式链表，返回头指针
PolyList CreatePolyList()
{
PolyNode *s,*rear,*head;
int e; //指数
float c; //系数
int n=1; //计数器
head =(PolyNode *) malloc(sizeof(PolyNode));
s->coef = sum;
s->exp = pa->exp;
rear->next = s;
rear = s;
}
//pa,pb指针后移
pa = pa->next;
pb = pb->next;
}
else if(pa->exp>pb->exp) //若pa指数大于pb指数，将pa结点副本插入到PolyC尾部
//Polynomial_list
//功能：输入两个多项式（不要求是升幂排列，程序将自动合并同类项和排序），进行加减乘除运算
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
//结点定义
typedef struct PolyNode
{
int exp; //指数
float coef; //系数
PolyNode* next;
}PolyNode , * PolyList;
//函数声明
PolyList CreatePolyList(); //创建多项式链表，返回头指针
void DisplayPolyList(PolyList Poly);//显示多项式
s->exp = pa->exp;
rear->next = s ;
rear = s ;
pa = pa->next;
}
else //若pb指数大于pa指数，将pb结点副本插入到PolyC尾部
{
s = (PolyNode *)malloc(sizeof(PolyNode));
float sum=0;//存储两项系数和
PolyNode *pa , *pb , *rear , *s ;
PolyC = (PolyNode *)malloc(sizeof(PolyNode));
pa = PolyA->next;
pb = PolyB->next;
rear = PolyC;
{
rear->next = p->next;
temp = p;
p = temp->next;
free(temp);
pre->next = q->next;
temp = q;
q = temp->next;
free(temp);
while(rear->next!=NULL)
{
exp = rear->next->exp;
p = rear->next ;
prior = rear;
temp = prior->next ;
while(p!=NULL)
{
if(p->exp > exp)
void SortPoly(PolyList Poly)
{
PolyList rear , p ,temp , prior;
if(!Poly->next) return; //若多项式为空，返回
MergePoly(Poly);
rear = Poly;
int exp;//记录当前啊搜索项中的最小指数
PolyNode *pa , *pb , *rear , *s ;
PolyC = (PolyNode *)malloc(sizeof(PolyNode));
pa = PolyA->next;
pb = PolyB->next;
rear = PolyC;
rear->next = NULL;
{
PolyNode * p , *temp;
p = L;
while(p!=NULL)
{temp = p ; p = p->next; free(temp); }
}
//将多项式和并同类项
void MergePoly(PolyList Poly)
{
PolyNode * p , *q , * rear ,*pre ,* temp;
rear = Poly;
p = Poly->next ;
while(rear->next!=NULL)
{
q = p->next;
pre = p;
temp = p;
while(q)
{
if(p->exp == q->exp) //两项指数相等，合并两项，并释放结点q
{
s = (PolyNode *)malloc(sizeof(PolyNode));
s->coef = sum;
s->exp = pa->exp;
rear->next = s;
rear = s;
}
//pa,pb指针后移
pa = pa->next;
}
}
//多项式相减，返回差多项式链表头指针
PolyList PolySub(PolyList PolyA , PolyList PolyB)
{
PolyList PolyC ;
SortPoly(PolyA);
SortPoly(PolyB);
float sum =0 ;//存储两项系数差
{
s = (PolyNode *)malloc(sizeof(PolyNode));
s->coef = pa->coef;
void DestroyPolyList(PolyList L);//释放链表所用存储空间
void MergePoly(PolyList Poly);//将多项式和并同类项
void SortPoly(PolyList Poly);//将多项式按升序排列
PolyList PolyAdd(PolyList PolyA , PolyList PolyB);//多项式相加，返回和多项式链表头指针
while(pa && pb)
{
if(pa->exp == pb->exp)
{
sum = pa->coef-pb->coef;
if(fabs(sum)>1e-6) //如果两两系数不为0，则将两项和存入s中，并插入PolyC尾部
{
s = (PolyNode *)malloc(sizeof(PolyNode));
{
exp = p->exp ;
temp = p ;
p = temp->next ;
}
else
{
p = p->next ;
if(rear->next->next ==NULL) return; //p为最后一个元素且指数最小，提前返回
s->coef = pa->coef;
s->exp = pa->exp;
rear->next = s;
pa = pa->next;
rear = s ;
}
while(pb)
{
s = (PolyNode *)malloc(sizeof(PolyNode));
rear->next = NULL;
while(pa && pb)
{
if(pa->exp == pb->exp)
{
sum = pa->coef+pb->coef;
if(fabs(sum)>1e-6) //如果两两系数不为0，则将两项和存入s中，并插入PolyC尾部
rear = head;
//输入多项式的系数和指数，若输入系数为0退出
printf("请输入多项式的第%d项的系数和指数(用逗号分开)：" , n++);
scanf("%f,%d" , &c , &e);
while(fabs(c) > 1e-6)
{ s = (PolyNode *)malloc(sizeof(PolyNode));
return head;
}
//计算两个多项式（可不按顺序排列） ， 结果存到链表PolyC中，并返回
PolyList PolyAdd(PolyList PolyA , PolyList PolyB)
{
PolyList PolyC ;
SortPoly(PolyA);