int ReverseList(LinkList l)
{
if(l == NULL)return 0;
LinkList p = l->next;
l->next = NULL;
while(p != NULL)
{
LinkList q = p;
p = p->next;
q->next = l->next;
l->next = q;
}
return 1;
}
数据结构:单向链表的逆序
最新推荐文章于 2022-07-31 12:34:02 发布
int ReverseList(LinkList l)
{
if(l == NULL)return 0;
LinkList p = l->next;
l->next = NULL;
while(p != NULL)
{
LinkList q = p;
p = p->next;
q->next = l->next;
l->next = q;
}
return 1;
}