数据结构与算法学习：单向链表逆序

2015-06-07

Word count: 33 | Reading time≈ 1 min

ListNode* reverse(ListNode* head){
    ListNode *n=head->next;
    ListNode *p=NULL;
        while(head!=NULL)
        {
            n=head->next;
            head->next=p;
            p=head;
            head=n;
        }
    return p;
 }

Donate

Copyright： Copyright is owned by the author. For commercial reprints, please contact the author for authorization. For non-commercial reprints, please indicate the source.