將單鏈表逆置,是的輔助空間複雜度爲O(1)
#include<stdio.h>
#include<stdlib.h>
struct Lnode
{
int data;
Lnode *next;
};
int Init(struct Lnode *L, int i)
{
struct Lnode *p;
struct Lnode *q=L;
int j=0;
while(j<i)
{
p = (struct Lnode *)malloc(sizeof(struct Lnode));
scanf("%d",&((*p).data));
(*p).next =NULL;
(*q).next = p;
q= p;
j++;
}
return 0;
}
int reverse(struct Lnode *L)
{
struct Lnode *p=L->next;
struct Lnode *q;
L->next=NULL;
while(p!=NULL)
{
q= (*p).next;
(*p).next = L->next;
L->next = p;
p = q;
}
return 0;
}
int main()
{
struct Lnode Head;
struct Lnode *L=&Head;
(*L).next = NULL;
int i = 5;
Init(L,i);
reverse(L);
struct Lnode *p =L->next;
while(p!=NULL)
{
printf("%d",(*p).data);
p=(*p).next;
}
return 0;
}