typedef struct node
    {
      ElemType data;
      struct node *prior
      struct node *next;
    }list;

 list *reverselist(list *head)
    {
      if ((NULL == head) || (NULL == head->next))
      {
        return head;
      }
      list *p1=head->next, *p2=p1->next, *p3=NULL;
      p1->next = NULL;
      while (p2)
      {
        p3 = p2->next;      // 保存當(dāng)前結(jié)點(diǎn)的下一結(jié)點(diǎn)
        p2->next = p1;      // 改變當(dāng)前結(jié)點(diǎn)的next域，指向它的前一個(gè)結(jié)點(diǎn)
        p1->prior = p2;     // 改變前一個(gè)結(jié)點(diǎn)的prior域，指向它的后一個(gè)結(jié)點(diǎn)
        p1 = p2;         // 指針移到下一個(gè)結(jié)點(diǎn)
        p2 = p3;
      }
      head->next = p1;       // 恢復(fù)頭結(jié)點(diǎn)
      p1->prior = head;
      return head;
    }

 list *reverselist(list *head)
    {
      if ((NULL == head) || (NULL == head->next))
      {
        return head;
      }
      list *p1=head, *p2=p1->next, *p3=NULL;
      p1->next = NULL;
      while (p2)
      {
        p3 = p2->next;
        p2->next = p1;
        p1->prior = p2;
        p1 = p2;
        p2 = p3;
      }
      head = p1;
      return head;
    }