数据结构实验之链表三：链表的逆置

数据结构实验之链表三：链表的逆置

Problem Description

Input

Output

Sample Input

12 56 4 6 55 15 33 62 -1

Sample Output

62 33 15 55 6 4 56 12

Hint

Source

#include<stdio.h>
#include<malloc.h>

struct node
{
    int data;
    struct node *next;
};
struct node *Creat()
{
    struct node *head,*p;
    head=(struct node *)malloc(sizeof(struct node));
    head->next=NULL;
    p=(struct node *)malloc(sizeof(struct node));
    scanf("%d",&p->data);
    while(p->data!=-1)
    {
        p->next=head->next;
        head->next=p;
        p=(struct node *)malloc(sizeof(struct node));
        scanf("%d",&p->data);
    }
    return (head);
}

int main()
{
    struct node *head;
    head=Creat();
    if(head->next!=NULL)
    {
        printf("%d",head->next->data);
        head=head->next;
    }
    while(head->next!=NULL)
    {
        printf(" %d",head->next->data);
        head=head->next;
    }
    printf("\n");
    return 0;
}