#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;
}
实验11-2-9 链表逆置
该程序定义了一个链表结构,通过`createlist()`函数创建链表,`reverse()`函数反转链表,然后`printlist()`打印链表。主要涉及链表节点的指针操作和内存管理,实现了输入数字序列构建链表并反转链表的功能。
摘要由CSDN通过智能技术生成