1 #include
2 #include
3 //系数 coefficient,coef4 //指数 exponent, expon
5 typedef struct polyNode*polynomial;6 structpolyNode {7 intcoef;8 intexpon;9 polynomial link;10 };11
12 polynomial readPoly();13 //输入 必须是从幂的降幂 输入
14 void attach(int c, int e, polynomial*prear);15 //把这一项插入到链表中
16 polynomial polyAdd(polynomial p1, polynomial p2);17 //主要进行多项式加法运算
18 polynomial polyMul(polynomial p1, polynomial p2);19 //主要进行多项式乘法运算
20 polynomial polySub(polynomial p1, polynomial p2);21 //主要进行多项式减法运算
22 int compare(int a, int b);//比较两个项的指数
23 voidprintPoly(polynomial p);24 void display();//显示计算器的选项
25
26
27 int main(void) {28 polynomial p1, p2, ps;29 intt;30 while (1) {31 display();32 scanf("%d", &t);33 switch(t) {34 case 1:35 p1 =readPoly();36 p2 =readPoly();37 ps =polyAdd(p1, p2);38 printPoly(ps);39 printf("是否继续操作: 是请输入1,否则输出0:");40 scanf("%d", &t);41 if (t == 1)42 system("cls");43 else if (t == 0)44 return 0;45 break;46 case 2:47 p1 =readPoly();48 p2 =readPoly();49 ps =polySub(p1, p2);50 printPoly(ps);51 printf("是否继续操作: 是请输入1,否则输出0:");52 scanf("%d", &t);53 if (t == 1)5