#include <stdio.h>
#include <stdlib.h>
typedef struct node
{
int data;
struct node *next;
}LinkNode, *LinkList;
LinkList Creat(LinkList head);
void Inverse(LinkList head);
void Output(LinkList head);
LinkList Creat(LinkList head)//建表
{
LinkList p = NULL;
LinkList q = NULL;
head = (LinkList) malloc (sizeof(LinkNode));
head->next = NULL;
q = head;
while (1)
{
p = (LinkList) malloc (sizeof(LinkNode));
p->next = NULL;
scanf("%d", &p->data);
if (0 == p->data)//输入0表示结束输入
{
free(p);
break;
}
q->next = p;
q = p;
}
return head;
}
void Inverse(LinkList head)//逆置
{
LinkList p = head->next;
LinkList tmp = NULL;
head->next = NULL;
while (NULL != p)
{
tmp = p->next;
p->next = head->next;
head->next = p;
p = tmp;
}
}
void Output(LinkList head)//输出
{
LinkList p = head->next;
while (NULL != p)
{
printf("%d ", p->data);
p = p->next;
}
printf("\n");
}
int main(void)
{
LinkList head = NULL;
head = Creat(head);
Output(head);
Inverse(head);
Output(head);
return 0;
}
温馨提示:答案为网友推荐,仅供参考