链表逆序-me

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

 #define LEN 2

 /**
 *Node data
 */
 typedef struct _ND
 {
     int no;
     struct _ND * next;
 }ND;

 /**
 * just test
 */
 ND * initial(void)
 {
     ND * head = NULL;
     ND * cur = NULL;
     int i;
     for (i = 0; i < LEN; ++i)
     {
         cur = (ND *)malloc(sizeof(ND));
         if (!cur)
             return NULL;
         memset(cur, 0, sizeof(ND));
         cur->no = i;
         if (!head)
             cur->next = NULL;
         else
             cur->next = head;
         head = cur;
     }
     return head;
 }

 /**
 * print linkerlist
 */
 void trave(ND * head)
 {
     ND * p = head;
     if (!p)
         return ;
     while (p)
     {
         printf("%d->", p->no);
         p = p->next;
     }
     printf("NULL\n");
 }

 /**
 * reverse linkerlist
 * 将后面的结点依次往前插....
 */
 ND * reverse(ND * head)
 {
     ND * p;
     ND * q;
     if (NULL == head || NULL == head->next)
         return head;
     p = head->next;
     head->next = NULL;
     while (p)
     {
         q = p->next;
         p->next = head;
         head = p;
         p = q;
     }
     return head;
 }

 int main(int argc, const char *argv[])
 {
     trave(initial());
     trave(reverse(initial()));
     return 0;
 }