算法与数据结构 上机----实训操作1 一元稀疏多项式

一元稀疏多项式的运算
要求：实现一元稀疏多项式的表示及基本操作（建立、销毁、输出、加法、减法等操作）
使用方法：一元多项式相加
1)课本P37中间 ，链表存储结构。
2)创建链表—自己完成，或者 InitList 构造空的链表。
3)算法课本2.21，合并链表。
注意：算法2.21中调用的所有函数都要自己完成。

执行代码：

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
 
/**********************一元多项式储存结构表示******************************/
 
typedef struct Polynomial {
int coefficient; //系数
int index; //指数
struct Polynomial *next;
}Plm;
 
#define SIZE sizeof(Plm)
 
/**********************模块函数******************************/
 
Plm *CreatPolyn(int m) //输入m项的系数和指数，建立一元多项式
{
Plm *p,*p1, *p2;
p1 = (Plm *)malloc(SIZE);
scanf("%d %d", &p1->coefficient, &p1->index);
m--;
p = p1;
while (m)
{
p2 = (Plm*)malloc(SIZE);
p1->next = p2;
scanf("%d %d", &p2->coefficient, &p2->index);
p1 = p2;
m--;
}
p1->next = NULL;
return p;
}
 
void DestroyPolyn(Plm *p) //一元多项式p存在，销毁p
{
Plm *q;
if (p == NULL)
printf("error");
else
while (p != NULL)
{
q = p;
p = p->next;
free(q);
}
}
 
void PrintPolyn(Plm *p) //输出一元多项式
{
while (p!=NULL)
 
{
printf("%dX^%d ", p->coefficient, p->index);
if (p->next != NULL && p->next->coefficient>=0) printf("+");
p = p->next;
}
printf("\n");
 
}
 
int PolynLength(Plm *p) //返回一元多项式p的项数
{
int i = 0;
while (p != NULL)
{
i++;
p = p->next;
}
return i;
}
 
Plm *AddPolyn(Plm *pa,Plm *pb) //完成多项式相加并销毁pb
{
Plm *p,*q, *q1;
q = (Plm*)malloc(SIZE);
q1 = q;
 
while (pa&&pb != NULL)
{
if (pa->index == pb->index)
{
q->next = pa;
q = q->next;
pa->coefficient = pa->coefficient + pb->coefficient;
p = pb;
pb = pb->next;
free(p);
pa = pa->next;
}
else if (pa->index < pb->index)
{
q->next = pa;
q = q->next;
pa = pa->next;
}
else
{
q->next = pb;
q = q->next;
pb = pb->next;
}
}
if (pa != NULL) q->next = pa;
else q->next = pb;
q1 = q1->next;
return q1;
}
 
Plm *SubtractPolyn(Plm *pa,Plm *pb) //完成多项式相减，pa = pa - pb;并销毁pb
{
Plm *p, *q, *q1;
q = (Plm*)malloc(SIZE);
q1 = q;
while (pa&&pb != NULL)
{
if (pa->index == pb->index)
{
q->next = pa;
q = q->next;
pa->coefficient = pa->coefficient - pb->coefficient;
p = pb;
pb = pb->next;
free(p);
pa = pa->next;
}
else if (pa->index < pb->index)
{
q->next = pa;
q = q->next;
pa = pa->next;
}
else
{
pb->coefficient = -pb->coefficient;
q->next = pb;
q = q->next;
pb = pb->next;
}
}
if (pa != NULL) q->next = pa;
else
{
q->next = pb;
while (pb != NULL)
{
pb->coefficient = -pb->coefficient;
pb = pb->next;
}
 
}
q1 = q1->next;
return q1;
}
 
 
int main()
{
Plm *head_A, *head_B;
int a = 0, b = 0;
//加
printf("输入A的项数:");
scanf("%d", &a);
printf("输入多项式A:");

head_A = CreatPolyn(a);//如何通过creatpolyn改变head的值？把head作为参数传进去而不是让函数返回头指针
printf("输入B的项数:");
scanf("%d", &b);
printf("输入多项式B:");
head_B = CreatPolyn(b);
head_A = AddPolyn(head_A, head_B);
PrintPolyn(head_A);
DestroyPolyn(head_A);
//减
printf("输入A的项数:");
scanf("%d", &a);
printf("输入多项式A:");
head_A = CreatPolyn(a);//如何通过creatpolyn改变head的值？把head作为参数传进去而不是让函数返回头指针
printf("输入B的项数:");
scanf("%d", &b);
printf("输入多项式B:");
head_B = CreatPolyn(b);
head_A = SubtractPolyn(head_A,head_B);
PrintPolyn(head_A);
DestroyPolyn(head_A);
 
 
return 0;
}

执行结果：
、