单向链表的反转问题

#ifndef LIST_H_INCLUDED
#define LIST_H_INCLUDED
#include <stdio.h>
#include <stdlib.h>
#define L_TYPE char
typedef struct Node node;
typedef struct Node* Plist;
typedef Plist  List;

struct  Node
{
    L_TYPE element;
    Plist next;
};
Plist Creatlist();    //creat a list note：hava an head node;
void Delete(Plist list);//delete an element of the list
void Insert_list(Plist list,L_TYPE element);// insert an element into the list
int L_isEmpty(Plist list);// judge whether the list is empty or not  if is empty return an integer else return 0;
Plist ReverseList(Plist list);// reverse the list  not : the parameter list is not the head node but next node of head node
                              //(if your list has no head node you can use this function directly)
Plist ReverseList(Plist list);

Plist Creatlist()
{
    Plist list=(List)malloc(sizeof(node));
    list->next=NULL;
    return list;

}
void Delete(Plist list)
{
    Plist temp;
    if(!L_isEmpty(list))
    {
        temp=list->next;
        list->next=list->next->next;
    }
    else
    {
        printf("List is empty!");
    }
}
void Insert_list(Plist list,L_TYPE element)
{
    Plist templist=(List)malloc(sizeof(node));
    templist->element=element;
    templist->next=list->next;
    list->next=templist;

}
int L_isEmpty(Plist list)
{
    return !list->next;
}

void Printlist(Plist list)
{
    Plist plist=list;
    while(plist->next)
    {
        printf("%c
",plist->next->element);
        plist=plist->next;
    }
}

Plist ReverseList(Plist list)
{
   Plist next;
   Plist previous=NULL;
   while(list)
   {
       next=list->next;
       list->next=previous;
       previous=list;
       list=next;
   }
   return previous;
}



#endif // LIST_H_INCLUDED

反转链表的简单解释；

 

注：我定义的单向链表有头结点；

所以下面代码中反转，多出一步头结点指向新链表头的步骤 如下图；

主函数代码；反转函数为 Plist ReverseList(Plist list)

#include <stdio.h>
#include <stdlib.h>
#include "list.h"
int main()
{
    int i;
    Plist list=Creatlist();
    for(i=0;i<5;i++)
    {
      Insert_list(list,'A'+i);
    }
    Printlist(list);
    printf("-----------------------------
");
    // reverse the list (with head node) there is little different from the list without head node for eg. below;
    list->next=ReverseList(list->next);
    //print the list
    Printlist(list);

return 0;

}