LeetCode206 反转链表

反转一个单链表。

示例:

输入: 1->2->3->4->5->NULL
输出: 5->4->3->2->1->NULL
进阶:
你可以迭代或递归地反转链表。你能否用两种方法解决这道题？

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */

==#1迭代==
class Solution {
public:
    ListNode* reverseList(ListNode* head) {
        
        //if( head == NULL || head->next == NULL )
         //   return head;
        
        ListNode* pre = NULL;
        ListNode* cur = head;
        
        while( cur != NULL ){
            ListNode* next = cur->next;
            cur->next = pre;
            pre = cur;
            cur = next; 
        }
        
        return pre;
    }
};


==#2递归==
class Solution {
public:
    ListNode* reverseList(ListNode* head) {
        
        if(!head || !head->next)
            return head;
        
        ListNode* resNode = reverse(head);
        
        return resNode;
    }
    
private:
    ListNode* reverse(ListNode* node){
        
        if(!node->next) return node;
        ListNode* ret = reverse(node->next);
        node->next->next = node;
        node->next = NULL;
        
        return ret;
    }
};