#include<stdio.h>
#include<stdlib.h>
struct node
{
int data;
struct node *next;
};
struct node *creat(int a[],int n)
{
struct node *head,*p;
head=(struct node*)malloc(sizeof(struct node));
head->next=NULL;
for(int i=0;i<n;i++)
{
p=(struct node*)malloc(sizeof(struct node));
p->data=a[i];
p->next=head->next;
head->next=p;
}
return head;
};
void reverselist(struct node *head)
{
struct node *p,*q;
p=head->next;
head->next=NULL;
while(p)
{
q=p;
p=p->next;
q->next=head->next;
head->next=q;
}
}
int main()
{
int a[]={1,2,3,4,5};
struct node *head,*p;
head=creat(a,5);
p=head->next;
printf("倒序之前输出:\n");
while(p)
{
printf("%d ",p->data);
p=p->next;
}
printf("\n");
printf("倒序之后输出\n");
reverselist(head);
p=head->next;
while(p)
{
printf("%d ",p->data);
p=p->next;
}
return 0;
}
#include<stdlib.h>
struct node
{
int data;
struct node *next;
};
struct node *creat(int a[],int n)
{
struct node *head,*p;
head=(struct node*)malloc(sizeof(struct node));
head->next=NULL;
for(int i=0;i<n;i++)
{
p=(struct node*)malloc(sizeof(struct node));
p->data=a[i];
p->next=head->next;
head->next=p;
}
return head;
};
void reverselist(struct node *head)
{
struct node *p,*q;
p=head->next;
head->next=NULL;
while(p)
{
q=p;
p=p->next;
q->next=head->next;
head->next=q;
}
}
int main()
{
int a[]={1,2,3,4,5};
struct node *head,*p;
head=creat(a,5);
p=head->next;
printf("倒序之前输出:\n");
while(p)
{
printf("%d ",p->data);
p=p->next;
}
printf("\n");
printf("倒序之后输出\n");
reverselist(head);
p=head->next;
while(p)
{
printf("%d ",p->data);
p=p->next;
}
return 0;
}