leetcode206_反转链表_迭代+递归

一. 迭代

1. 有pre, cur还要保存cur->next.

class Solution {
public:
    ListNode* reverseList(ListNode* head) {
        if(head==NULL || head->next==NULL) return head;
        //前驱指针,cur需要指向它.        
        ListNode* pre = NULL;
        ListNode* cur = head;
        while(cur!=NULL) {
            //保存后继指针.
            ListNode* tmp = cur->next;
            cur->next = pre;
            //移动进行迭代.
            pre = cur;
            cur = tmp;
        }
        //此时pre才是最后一个指针.
        return pre;
    }
};

二. 递归

1. 

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* reverseList(ListNode* head) {
        //递归终止条件.
        if(head==NULL || head->next==NULL) return head;
        //假设函数的功能是反转head为头结点之后的链表,并返回
        //反转之后的头结点.
        ListNode* last = reverseList(head->next);
        head->next->next = head;
        //别忘了指向NULL.
        head->next = NULL;
        //返回反转后的头结点.
        return last;
    }
};