pb = pb->next; } }
while(pa) {
pd = (struct node*)malloc(sizeof(struct node)); pd->next = Ld->next; Ld->next = pd;
pd->coef = pa->coef; pd->exp = pa->exp; pa = pa->next; }
while(pb) {
pd = (struct node*)malloc(sizeof(struct node)); pd->next = Ld->next; Ld->next = pd;
pd->coef = -pb->coef; pd->exp = pb->exp; pb = pb->next; } }
int main() {
int sign;
polynmial La, Lb, Lc, Ld;
printf(\请输入第一个多项式：\\n\create(La); sort(La);
printf(\请输入第二个多项式：\\n\create(Lb); sort(Lb);
select();
scanf(\switch(sign) {
case 1:
printf(\多项式之和为:\\n\ add(La, Lb, Lc); sort(Lc);
reverse(Lc); display(Lc); break; default:
printf(\多项式之差为:\\n\ subtract(La, Lb, Ld); sort(Ld); reverse(Ld); display(Ld); break; } int a;
printf(\是否继续进行运算？scanf(\if(a==1) main(); else if (a==0) return 0; }
，是；2，否\1
