#include <stdio.h>
#include <stdlib.h>
struct stu{
int age;
struct stu* next;
};
typedef struct stu STU;
int len = sizeof(STU);
STU* CreateNode(int n)//创建n个节点
{
STU *head, *pb, *pf;
for(int i = 0; i < n; i++)
{
pb = (STU*)malloc(len);
printf("输入年纪:");
scanf("%d", &pb->age);
if(i == 0)
{
pf = head = pb;
}
else
{
pf->next = pb;
}
pb->next = NULL;
pf = pb;
}
return head;
}
STU* Reverse(STU* head)
{
STU* pCurrent = head->next;
STU* pTemp = NULL;
head->next = NULL;
while(pCurrent != NULL)
{
pTemp = pCurrent->next;//保存下一个节点地址
pCurrent->next = head;
head = pCurrent;
pCurrent = pTemp;
}
return head;
}
链表反转
最新推荐文章于 2023-01-03 17:39:24 发布