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

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

Time Limit: 1000MS Memory Limit: 65536KB

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

不得使用数组。

Author

 

#include <stdio.h>
#include <stdlib.h>
struct node
{
    int data;
    struct node *next;
};
struct node *creat();
struct node *creat2(struct node *head);
static int sum = 0;
int main()
{
    int i;
    struct node *head,*p, *q, *r;
    head = creat();
    p = head->next;
    q = head;
    head->next = NULL;
    for(i = 0;i < sum;i++)
    {
        r = (struct node *)malloc(sizeof(struct node));
        r->data = p->data;
        r->next = head->next;
        head->next = r;
        p = p->next;
    }
    p = head->next;
    for(i = 0;i < sum;i++)
    {
        printf("%d%c",p->data,i == sum - 1?'\n':' ');
        p = p->next;
    }
    return 0;
}
struct node *creat()
{
    struct node *head, *p, *tail;
    head = (struct node *)malloc(sizeof(struct node));
    head->next = NULL;
    tail = head;
    while(1)
    {
        p = (struct node *)malloc(sizeof(struct node));
        scanf("%d",&p->data);
        p->next = NULL;
        tail->next = p;
        tail = p;
        if(p->data == -1)
            break;
            sum++;
    }
    return (head);
}