［LeetCode］206. Reverse Linked List 解题小结

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
 
/**
 * Reverse Iteratively
 */
class Solution {
public:
    ListNode* reverseList(ListNode* head) {
        ListNode* revHead = NULL;
        ListNode* rev = head;
        
        while(rev){
            head = rev;
            rev = rev->next;
            head->next = revHead;
            revHead = head;
        }
        
        return revHead;
        
    }
};

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
 
/**
 * Reverse Iteratively
 */
class Solution {
public:
    ListNode* reverseList(ListNode* head) {
        
        if(!head || (!head->next))return head;
        ListNode* node = reverseList(head->next);
        head->next->next = head;
        head->next = NULL;
        return node;
        
    }
};