实验11-2-9 链表逆置

重生之我会拧瓶盖

于 2023-03-19 16:45:59 发布

阅读量228

点赞数

分类专栏： C语言和数据结构文章标签：链表数据结构 c语言

本文链接：https://blog.csdn.net/MH3709/article/details/129652763

版权

C语言和数据结构专栏收录该内容

5 篇文章 0 订阅

订阅专栏

原题链接++++++

#include <stdio.h>
#include <stdlib.h>

struct ListNode {
    int data;
    struct ListNode *next;
};

struct ListNode *createlist(); /*裁判实现，细节不表*/
struct ListNode *reverse( struct ListNode *head );
void printlist( struct ListNode *head )
{
     struct ListNode *p = head;
     while (p) {
           printf("%d ", p->data);
           p = p->next;
     }
     printf("\n");
}

int main()
{
    struct ListNode  *head;

    head = createlist();
    head = reverse(head);
    printlist(head);
    
    return 0;
}
struct ListNode *createlist()
{
    struct ListNode *l=NULL,*r=NULL,*s;
    int x;
    while (scanf ("%d",&x),x!=-1)
    {
        s = (struct ListNode *) malloc(sizeof (struct ListNode));
        s->data = x;
        if (r)
        {
            r->next = s;
            r = s;
        }
        else
            l = r = s;
    }
    return l;
}
/* 你的代码将被嵌在这里 */
struct ListNode *reverse( struct ListNode *head )
{
    struct ListNode *l = head,*r,*st=NULL;
    while (l)
    {
        r = l->next;
        if (st)
        {
            l->next = st;
            st = l;
        }
        else
        {
            st = l;
            st->next = NULL;
        }
        l = r;
    }
    return st;
}