#include <stdio.h>
#include <stdlib.h>
struct ListNode {
int data;
struct ListNode *next;
}ds;
struct ListNode *createlist();
int main()
{
struct ListNode *p, *head = NULL;
head = createlist();
for ( p = head; p != NULL; p = p->next )
printf("%d ", p->data);
printf("\n");
return 0;
}
struct ListNode *createlist()
{
struct ListNode *q,*p,*h;
h=NULL;
q=(struct ListNode *)malloc(sizeof(struct ListNode));
scanf("%d",&q->data);
q->next=NULL;
while(q->data!=-1)
{
if(!h)
h=q;
else
{
q->next=h;
h=q;
}
q=(struct ListNode *)malloc(sizeof(struct ListNode));
scanf("%d",&q->data);
q->next=NULL;
}
free(q);
return h;
}
链表逆置-头插法创建
最新推荐文章于 2022-04-30 22:56:22 发布