链表的逆转

#include<stdio.h>
#include<malloc.h>
typedef struct Node
{
int data;
struct Node *next;

}Seqlist;
Init(Seqlist *p){
int i=0;


Seqlist *p1=(Seqlist *)malloc(sizeof(Seqlist));
Seqlist *p2=(Seqlist *)malloc(sizeof(Seqlist));
p2=p;


    p2->next=p->next=NULL;
while(i<=5)
{  
Seqlist *p3=(Seqlist *)malloc(sizeof(Seqlist));
p3->data=i;
p2->next=p3;
p2=p3;
i++;
}
p2->next=NULL;
}
//带头结点的链表逆置
nizhi(Seqlist *p)
{
  Seqlist *p1;
  Seqlist *p2;
  Seqlist *p3;
p1=p->next;
p2=p1->next;
    p1->next=NULL;


  //逆置开始啦~
while(p2!=NULL)
{
p3=p2;
p2=p2->next;
p3->next=p->next;
p->next=p3;
}


}
void main()
{
Seqlist *s;
    Seqlist *p4;
s=(Seqlist *)malloc(sizeof(Seqlist));
p4=(Seqlist *)malloc(sizeof(Seqlist));
Init(s);
nizhi(s);
p4=s->next;
while(p4!=NULL)
  {
 printf("%d",p4->data);
 p4=p4->next;
  }


}