node *Reverse(node *head)
{
node *p1 , *p2 , *p3;
if(head == NULL || head -> next == NULL) return head;
p1 = head , p2 = head -> next;
while(p2 != NULL)
{
p3 = p2 -> next;
p2 -> next = p1;
p1 = p2 ;
p2 = p3;
}
head -> next = NULL;
head = p1 ;
return head;
}
单链表反转
最新推荐文章于 2021-11-02 19:37:08 发布