#35 Reverse Linked List

题目描述：

Reverse a linked list.

Have you met this question in a real interview? 

Yes

Example

For linked list 1->2->3, the reversed linked list is 3->2->1

Challenge 

Reverse it in-place and in one-pass

题目思路：

这题要用dummy head！然后设3个指针（之所以要3个是因为在re-link的过程中会丢失指针信息，必须要有3个来记录），搞清楚关系就好了。

Mycode（AC = 12ms）：

/**
 * Definition of ListNode
 * 
 * class ListNode {
 * public:
 *     int val;
 *     ListNode *next;
 * 
 *     ListNode(int val) {
 *         this->val = val;
 *         this->next = NULL;
 *     }
 * }
 */
class Solution {
public:
    /**
     * @param head: The first node of linked list.
     * @return: The new head of reversed linked list.
     */
    ListNode *reverse(ListNode *head) {
        // write your code here
        if (head == NULL) return NULL;
        
        ListNode *dummy = new ListNode(0);
        dummy->next = head;
        ListNode *prev = dummy, *cur = head, *next = head->next;
        
        // dummy->1->2->3: prev - dummy, cur - 1, next - 2
        while (next) {
            cur->next = next->next; // 1->3
            next->next = prev->next; // 2->1
            prev->next = next; // dummy->2
            
            next = cur->next; // next->3
        }
        
        return dummy->next;
    }
};