单链表反转

void reverse(List* list)
{
Node
* before = list->first;
if (before != NULL)
{
Node
* after = before->next;
before
->next = NULL;
while (after)
{
//交换指针
Node* temp = after->next;
after
->next = before;
before
= after;
after
= temp;
}
}
}

posted on 2011-05-09 21:43  NULL00  阅读(454)  评论(0编辑  收藏  举报

导航