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

Problem Description

输入多个整数，以-1作为结束标志，顺序建立一个带头结点的单链表，之后对该单链表的数据进行逆置，并输出逆置后的单链表数据。

Input

输入多个整数，以-1作为结束标志。

Output

输出逆置后的单链表数据。

Example Input

12 56 4 6 55 15 33 62 -1

Example Output

62 33 15 55 6 4 56 12

Hint

不得使用数组。

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#define ERROR -1
#define OVERFLOW -2
#define OK 1

typedef int Elemtype;
typedef int Statu;
typedef struct Lnode
{
    Elemtype data;
    struct Lnode *next;
} Link;

Link * Creat();
Link * Negative(Link *head);
Statu Dis_Link(Link *head);

int main()
{
    Link *head;
    head = Creat();
    Negative(head);
    Dis_Link(head);
    return 0;
}
Link *Creat()
{
    Link *head, *p, *q;
    int n;
    head = (Link *)malloc(sizeof(Link));
    head -> next = NULL;
    q = head;
    while(scanf("%d", &n) && n != -1)
    {
        p = (Link *)malloc(sizeof(Link));
        p -> next = NULL;
        p -> data = n;
        q -> next = p;
        q = p;
    }
    return head;
}
Link * Negative(Link *head)
{
    Link *q, *p;
    p = head -> next;
    head -> next = NULL;
    q = p -> next;
    while(p)
    {
        p -> next = head -> next;
        head -> next = p;
        p = q;
        if(q)
        {
            q = q -> next;
        }
    }
    return head;
}
Statu Dis_Link(Link *head)
{
    Link *p;
    p = head -> next;
    while(p -> next)
    {
        printf("%d ", p -> data);
        p = p -> next;
    }
    printf("%d\n", p -> data);
    return OK;
}