单向链表的逆转

 

 

List Reverse(List L)    //带头结点的单链表
{
    Node *p, *q;
    p = L->next;
    L->next = NULL;
    while(p)
    {
        q = p->next;
        p->next = L->next;
        L->next = p;
        p = q;
    }
    
    return L;
}