#include<stdio.h>
#include<stdlib.h>
/*
编写算法将带头结点的单链表就地逆置,空间复杂度为O(1)
*/
typedef struct LNode {
int data;
struct LNode* next;
}LNode,*LinkList;
void PrintList(LinkList L)
{
L = L->next;
while (L)
{
printf("%4d", L->data);
L = L->next;
}
}
LinkList CreateList(LinkList& L)
{
int x;
LNode* s;
L = (LinkList)malloc(sizeof(LNode));
LNode* r = L;
scanf("%d", &x);
while (x != 99)
{
s = (LNode*)malloc(sizeof(LNode));
s->data = x;
r->next = s;
r = s;
scanf("%d", &x);
}
r->next = NULL;
return L;
}
LinkList ReverseList(LinkList& L)
{
LNode* p;
LNode* r;
p = L->next;
L->next = NULL;
while (p)
{
r = p->next;
p->next = L->next;
L->next = p;
p = r;
}
return L;
}
int main()
{
LinkList L;
CreateList(L);
ReverseList(L);
printf("逆置后的链表为:");
PrintList(L);
return 0;
}