一元多项式加法运算

#include <stdio.h> 
#include <stdlib.h> 
#define OK 1 
#define ERROR 0 
#define TRUE 1 
#define FALSE 0 
typedef int ElemType; 
typedef int Status; 
typedef struct LNode 
{ 
  ElemType coef; //系数  
  ElemType exp;  //指数  
  struct LNode *next; 
}LNode, *LinkList;  //线性链表的结构 
void CreateList(LinkList &H) 
{ 
  int a, b, n; 
  LinkList p; 
  scanf("%d", &n); 
  H = (LinkList)malloc(sizeof(LNode)); 
  p = H; 
  for (int i = 0; i<n; i++) 
  { 
    scanf("%d%d", &a, &b); 
    p->next = (LinkList)malloc(sizeof(LNode)); 
    p = p->next; 
    p->coef = a; 
    p->exp = b; 
  } 
  p->next = NULL; 
}//CreateList  //以线性链表的结构建立一元多项式  
void PrintList(LinkList &head) 
{ 
  LinkList p; 
  p = head->next; 
  if (p == NULL) 
  { 
    printf("<0,0>\n"); 
    return; 
  } 
  else{ 
    printf("<%d,%d>", p->coef, p->exp); 
    p = p->next; 
  } 
  while (p) 
  { 
    printf(",<%d,%d>", p->coef, p->exp); 
    p = p->next; 
  } 
  printf("\n"); 
}//PrintList 
void AddPolyn(LinkList &pa, LinkList &pb) 
{ 
  int sum = 0; 
  LinkList a, b, q, cur; 
  a = pa->next; 
  b = pb->next; 
  cur = pa; 
  while ((a != NULL) && (b != NULL)) 
  { 
    if (a->exp < b->exp) 
    { 
      cur = a; 
      a = a->next; 
    } 
    else if (a->exp == b->exp) 
    { 
      sum = a->coef + b->coef; 
      if (sum == 0) 
      { 
        q = a->next; 
        free(a); 
        a = q; 
        cur->next = q; 
      } 
      else 
      { 
        a->coef = sum; 
        cur = a; 
        a = a->next; 
      } 
      q = b; 
      b = b->next; 
      free(q); 
    } 
    else 
    { 
      q = b->next; 
      b->next = a; 
      cur->next = b; 
      cur = b; 
      b = q; 
    } 
  } 
  if (b) 
    cur->next = b; 
}//AddPolyn 
Status main() 
{ 
  int N;  
  while (scanf("%d", &N)!=EOF) 
  { 
    if (N == 0) 
      break; 
    LinkList pa, pb, pc; 
    CreateList(pa); 
    CreateList(pb); 
    CreateList(pc); 
    PrintList(pa); 
    PrintList(pb); 
    PrintList(pc); 
    AddPolyn(pa, pb); 
    PrintList(pa); 
    AddPolyn(pa, pc); 
    PrintList(pa); 
  } 
  return 0; 
}