#include<stdio.h>
#include<stdlib.h>
typedef struct node
{
int data;
struct node *next;
}Node;
Node * head;
Node * ListInit()
{
Node * p;
p = (Node *)malloc(sizeof(Node));
p->next = NULL;
head = p;
return head;
}
Node * InsertList(Node * head)
{
Node *p, *p1;
p = head;
p1 = (Node *)malloc(sizeof(Node));
while(p->next != NULL)
{
p = p->next;
}
printf("Please input number!\n");
scanf("%d",&p1->data);
p1->next = p->next;
p->next = p1;
return head;
}
void ListDisply(Node * head)
{
Node * p,*p1;
p = head;
// p1 = (Node *)malloc(sizeof(Node));
p1 = p->next;
while(p1 != NULL)
{
printf("%d ",p1->data);
p1 = p1->next;
}
}
Node * ListBack(Node * head)
{
Node *p, *p1, *pnew, *q;
p = head;
p1 = p->next;
pnew = NULL;
while(p1 != NULL)
{
q = p1;
p1 = p1->next;
q->next = pnew;
pnew = q;
// p1 = p1->next;
}
head->next = pnew;
return head;
}
int main()
{
Node * h1, *h2;
h1 = ListInit();
InsertList(h1);
InsertList(h1);
InsertList(h1);
h2 = ListBack(h1);
ListDisply(h2);
return 0;
}