typedef struct Node
{
int value;
Node* next;
}node;
if ( Head== NULL || Head->next == NULL)
{
return Head;
}
Node *p1 = NULL, *p2 = NULL, *p3 = NULL;
p1 = Head;
p2 = Head->next;
p1->next = NULL;
if (p2->next != NULL)
{
p3 = p2->next;
}
while (p2 != NULL)
{
p2->next = p1;
p1 = p2;
p2 = p3;
if (p3 != NULL)
{
p3 = p3->next;
}
}
Head = p1;
return Head;
}
剑指offor面试题16:反转链表
最新推荐文章于 2022-05-05 10:42:52 发布