单链表的反转

Node *list_reverse(Node *head) { 
    if(NULL == head) {
        return NULL;
    }
    Node *prev,*curr,*reverse_head,*temp;
    prev=NULL,curr=head;
    while(curr->next) {
        temp=curr->next;
        curr->next=prev;
        prev=curr;
        curr=temp;
    }
    curr->next=prev;
    reverse_head=curr;
    return reverse_head;
}