#include<stdio.h>
#include<stdlib.h>
/*
* 设L为带头结点的单链表,编写算法实现从尾到头反向输出每个结点的值
*/
typedef struct LNode {
int data;
struct LNode* next;
}LNode,*LinkList;
LinkList CreateLinkList(LinkList& L) //尾插法创建链表
{
int x;
L = (LinkList)malloc(sizeof(LNode));
LNode* s;
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;
}
void ReversePrint(LinkList L)
{
LNode* s;
LNode* q;
LNode* p = L->next;
s = (LNode*)malloc(sizeof(LNode));
while (p != NULL)
{
q = p->next;
p->next = s;
s = p;
p = q;
}
while (s!= NULL)
{
printf("%4d", s->data);
s = s->next;
}
}
int main()
{
LinkList L;
CreateLinkList(L);
ReversePrint(L);
return 0;
}