反转链表

  这个没什么好说的,直接上代码了

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

#define N 10

typedef struct list
{
  int num;
  struct list* next;
}LIST;

void init_list(LIST** L)
{
  *L = (LIST*)malloc(sizeof(LIST));
  (*L)->next = NULL;
}

void add_list(LIST* L, int num)
{
   LIST* p = (LIST*)malloc(sizeof(LIST));
   p->num = num;
   p->next = L->next;
   L->next = p;
}

void printf_list(LIST* L)
{
  LIST* p = L->next;
  while(p!=NULL)
   {
     printf("%d\t",p->num);
     p = p->next;
   }
}

void revert_list(LIST* L)
{
  LIST* pNode = L->next;
  LIST* Prev = NULL;
  LIST* Next = NULL;
  
  while(pNode!=NULL)
   {
     Next = pNode->next;
     if(Next == NULL)
       L->next = pNode;
       
     pNode->next = Prev;
     Prev = pNode;
     pNode = Next;
   }
}

int main(int argc, char *argv[])
{
  int i = 0;
  int num;
  LIST* L = NULL;
  srand((unsigned)time(NULL));
  init_list(&L);
  
  for(; i<N; i++)
   {
    num = rand()%100+1;
    add_list(L, num);
   }
  
  printf("The original list is:\n");
  printf_list(L);
  revert_list(L);
  printf("After revert the list is:\n");
  printf_list(L);
  system("PAUSE");    
  return 0;
}