链表知识点（七）【单链表的逆置】

Link * Reverse_link(Link * Head)
{

Link * p1;
Link * p2;
Link * p3;
p1 = Head;

p2 = p1->next;

if(Head == NULL || Head->next == NULL)
{

return Head;

}
while(p2 != NULL)
{

p3 = p2->next;//创建新的结点

p2->next = p1;

p1 = p2;

p2 = p3;

}

Head->next = NULL;

Head = p1;

return Head;//p1成为链表的头了。

}