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

素颜马尾好姑娘i 2022-06-01 04:58 124阅读 0赞

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

#### 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 #include <stdio.h>
    #include <stdlib.h>
    struct sdut
    {
        int data;
        struct sdut *next;
    }*head, *q, *p, *tail;
    int main()
    {
        int a;
        head = (struct sdut*) malloc (sizeof(struct sdut));
        head -> next = NULL;
        tail = head;
        while(scanf("%d", &a) != EOF)
        {
            if(a == -1)
            break;
            else
            {
                p = (struct sdut*) malloc (sizeof(struct sdut));
                p -> data = a;
                p -> next = NULL;
                tail -> next =p;
                tail = p;
            }
        }
        p = head -> next;
        head -> next = NULL;
        q = p -> next;
        while(p != NULL)
        {
            p  -> next = head -> next;
            head -> next = p;
            p = q;
            if(q != NULL)
            {
                q = q -> next;
            }
        }
        p = head -> next;
        while(p)
        {
            if(p -> next)
            {
                printf("%d ", p -> data);
            }
            else
            {
                printf("%d\n", p -> data);
            }
            p = p -> next;
        }
        return 0;
    }