동적할당을 이용한 다항식 계산 코드 좀 살펴주시면..

#include <stdio.h> 
#include <stdlib.h> 

#define IS_FULL(temp) (!(temp)) 
#define Compare(x,y) (((x) < (y)) ? -1 : ((x) == (y)) ? 0 : 1) 

typedef struct poly_node *poly_pointer; 
struct poly_node{ 
   int coef; 
   int exp; 
   poly_pointer link; 
}; 

void attach(int coef, int exp, poly_pointer *ptr); 
poly_pointer padd(poly_pointer a, poly_pointer b); 

void prt_list1(poly_pointer ptr)
{
	printf("-----------------------------------\n");
	while(ptr)
	{
		printf("c:%d  e:%d\n", ptr->coef, ptr->exp);
		ptr=ptr->link;
	}
	printf("-----------------------------------\n");
}

int main(void)
{ 

   poly_pointer front1, rear1, front2, rear2, temp, result; 
   int coef, exp; 
 
   rear1 = (poly_pointer)malloc(sizeof(struct poly_node)); 
   if(IS_FULL(rear1))
   { 
      fprintf(stderr, "The memory is full\n"); 
      exit(1); 
   } 

   front1 = rear1;


    printf("Input poly1(if coef is '0' then end): "); 
    while(1)
	{ 
      printf("coef: ");      scanf("%d", &coef); 
      if(coef == 0) 
         break; 
      printf("exp: ");      scanf("%d", &exp); 
      if(exp == 0)
	  { 
         attach(coef, exp, &rear1); 
         break; 
      } 
      attach(coef, exp, &rear1); 
    } 

	rear1->link=NULL;
   
	temp=front1; front1=front1->link; free(temp);

	prt_list1(rear1);
	prt_list1(front1);


	rear2 = (poly_pointer)malloc(sizeof(struct poly_node)); 
	if(IS_FULL(rear2))
	{ 
	  fprintf(stderr, "The memory is full\n"); 
	  exit(1); 
	} 

	front2 = rear2;
	
    printf("Input poly2(if coef is '0' then end): "); 
    while(1)
	{ 
      printf("coef: ");      scanf("%d", &coef); 
      if(coef == 0) 
         break; 
      printf("exp: ");      scanf("%d", &exp); 
      if(exp == 0)
	  { 
         attach(coef, exp, &rear2); 
         break; 
      } 
      attach(coef, exp, &rear2); 
    } 

    rear2->link=NULL;
   
	temp=front2; front2=front2->link; free(temp);

    printf("\n"); 

	prt_list1(rear2);
	prt_list1(front2);
    
   result = padd(front1, front2); 

   prt_list1(result);

   while(result)
   { 
      if(result->link) 
		  printf("%dx^%d + ", result->coef, result->exp); 
      else 
		  printf("%dx^%d\n", result->coef, result->exp); 
         
      result = result->link; 
   } 
    
   return 0;
} 

void attach(int coef, int exp, poly_pointer* ptr)
{ 
   poly_pointer temp; 

   temp = (poly_pointer)malloc(sizeof(struct poly_node)); 

   if(IS_FULL(temp))
   { 
      fprintf(stderr, "Memory is full!\n"); 
      exit(1); 
   } 

   temp->coef = coef; 
   temp->exp = exp; 

   (*ptr)->link=temp;
   *ptr=temp;
   temp->link = NULL; 
} 

poly_pointer padd(poly_pointer a, poly_pointer b)
{ 
   poly_pointer front, rear, temp; 
   int sum; 

   rear = (poly_pointer)malloc(sizeof(struct poly_node)); 
   if(IS_FULL(rear))
   { 
      fprintf(stderr, "The memory is full\n"); 
      exit(1); 
   } 

   front = rear; 

   while(a && b)
   { 
      switch(Compare(a->exp,b->exp))
	  { 
      case -1: 
         attach(a->coef, a->exp, &rear); 
         a = a->link; 
         break; 
      case 0: 
         sum = a->coef + b->coef; 
         if(sum)   attach(sum, a->exp, &rear); 
         a = a->link;   b = b->link; 
         break; 
      case 1: 
         attach(b->coef, b->exp, &rear); 
         b = b->link; 
         break; 
      } 
   } 

   for(; a; a = a->link)   attach(a->coef, a->exp, &rear); 
   for(; b; b = b->link)   attach(b->coef, b->exp, &rear); 

   rear->link=NULL;
   
   temp=front; front=front->link; free(temp);

   return front; 
} 

올려주신 코드에서 main()함수를 기준으로 수정했었는데, 다시 보니

원하는 것이 그게 아닌 것 같군요. 원하는 것이 맞으신가 모르겠네요.

erase()는 뺐습니다.