1初始状态:.
2.第一次反转:
3第二次反转:
4第三次反转:
由上述过程可以得出:
a.初始条件:prev=null;
b.循环条件:next=head->next;
head->next=prev;
prev=head;
head=next;
c.结束条件:head=null;
代码如下:
LinkList *ReverseLink(LinkList *head)
{
LinkList *next;
LinkList *prev = NULL;
while(head != NULL)
{
next = head->next;
head->next = prev;
prev = head;
head = next;
}
return prev;
}