[leetcode] Reverse Linked List

链表简单题，遍历头插法即可。代码如下：

ListNode* reverseList(ListNode* head) {
        if(!head)
            return head;
        ListNode dummy(-1);
        dummy.next = head;
        ListNode *cur = head;
        ListNode *next = cur->next;
        cur->next = NULL;
        while(next){
            dummy.next = next;
            next = next->next;
            dummy.next->next = cur;
            cur = dummy.next;
        }
        return dummy.next;
    }