LeetCode 206:Reverse Linked List

Reverse a singly linked list.

单向链表的翻转，代码如下：

    ListNode* reverseList(ListNode* head) {
        if(head == NULL || head->next == NULL)
            return head;
        ListNode Result(0);
        ListNode *p = head;
        while (p) {
            ListNode *q = p->next;
            p->next = Result.next;
            Result.next = p;
            p = q;
        }
        return Result.next;
    }