数据结构练习（17）反转链表

struct ListNode {
int value;
ListNode *next;
};

ListNode * reverse_list(ListNode *head)
{
ListNode *rvs = NULL;
ListNode *pre = NULL;
ListNode *node = head;

while (node != NULL)
{
ListNode *next = node->next;

if (next != NULL)
rvs = node;

node->next = pre;
pre = node;
node = next;
}
return rvs;
}