带头结点的单链表转置

//带头结点单链表转置
#include<stdio.h>
#include<malloc.h>
//定义链表结构体
typedef struct Node
{
int value;
struct Node* next;
}Node,*LinkList;
//初始化链表
void InitList(LinkList* L)
{
(*L)=(Node*)malloc(sizeof(Node));
(*L)->next = NULL;
}
//尾插法创建单链表
void CreatListTail(LinkList L)
{
int data;
Node* s;
Node* r;
r = L;
scanf("%d",&data);
while(data != -1)//以-1位结束条件
{
s = (Node*)malloc(sizeof(Node));
s->value = data;
r->next = s;
s->next = NULL;
r = s;
scanf("%d",&data);
}
}
//输出单链表
void ShowList(const LinkList L)
{
Node* r;
r = L;
while(r->next != NULL)
{
r = r->next;
printf("%d ",r->value);
}
printf("\n");
}
//用三个节点转置单链表
void ReverseList(LinkList L)
{
Node* temp1;
Node* temp2;
Node* temp3;
temp1 = L->next;
temp2 = temp1->next;
temp3 = temp2->next;
temp1->next = NULL;//先将第一个节点的next置空
while(temp3 != NULL)//如果有三个以上节点则转置
{
temp2->next = temp1;//每次换一个
//三个节点后移
temp1 = temp2;
temp2 = temp3;
temp3 = temp3->next;
}
temp2->next = temp1;
L->next = temp2;
}
int main(void)
{
LinkList L;
InitList(&L);
CreatListTail(L);
ShowList(L);
ReverseList(L);
ShowList(L);
return 0;
}