Reverse Linked List

Reverse a singly linked list.

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
//添加头结点的方案
ListNode* reverseList(ListNode* head) {
    ListNode dummy(-1);
    dummy.next = NULL;
    ListNode * cur = head;
    while(cur){
        ListNode * tmp = cur->next;
        cur->next = dummy.next;
        dummy.next = cur;
        cur = tmp;
    }
    return dummy.next;
}
//不添加头结点的方案
ListNode* reverseList(ListNode* head) {
    //solution without dummy head
    ListNode * prev = NULL, * cur = head;
    while(cur){
        ListNode * tmp = cur->next;
        cur->next = prev;
        prev = cur;
        cur = tmp;
    }
    return prev;
}
//早期没有优化的方案
class Solution {
public:
    ListNode* reverseList(ListNode* head) {
        if(!head || !head->next)
        {
            return head;
        }
        ListNode * prev = head;
        ListNode * curr = head->next;
        head->next = nullptr;
        while(curr->next)
        {
            ListNode * temp = curr->next;
            curr->next = prev;
            prev = curr;
            curr = temp;
        }
        curr->next = prev;
        return curr;
    }
};