ListNode* NotHeadReverse(LinkList head)
{
if (head == NULL || head->next == NULL)
{
return head;
}
ListNode* pre = NULL, * s = NULL, * p = head;
while (p != NULL)
{
s = p;
p = p->next;
s->next = pre;
pre = s;
}
return pre;
}
(不带头结点的)单链表逆置
最新推荐文章于 2023-03-12 21:26:15 发布