【剑指offer】面试题24：反转链表——栈实现、三指针、递归反转

方法一：栈实现

通过栈把链表里面的值进行保存，最后在把栈里的值取出来放进链表中

/**
 * 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) {
        stack<int> record;
        ListNode* pNode = head;
        while( pNode != nullptr )
        {
            record.push(pNode->val);
            pNode = pNode->next;
        }

        ListNode* pNodeNew = head;

        while( !record.empty() )
        {
            pNodeNew->val = record.top();
            record.pop();
            pNodeNew = pNodeNew->next;
        }
        

        return head;

    }
};

方法二：三指针

/**
 * 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 == nullptr || head->next == nullptr)
        {
            return head;
        }

        //定义三个指针  pNodeSecond   pNodeFirst  temp 以此往后移动
        ListNode* pNodeFirst = head;
        ListNode* pNodeSecond = nullptr;
        
        //最终结果：  末尾节点           null
        //          pNodeSecond       pNodeFirst
        while( pNodeFirst != nullptr )
        {
            //第三个指针
            ListNode* temp = pNodeFirst->next;
            pNodeFirst->next = pNodeSecond;
            pNodeSecond = pNodeFirst;
            pNodeFirst = temp;

        }
        return pNodeSecond;
    }
};

方法三：递归反转

/**
 * 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 == nullptr || head->next == nullptr)
        {
            return head;
        }

        ListNode* tail = reverseList(head->next);
        head->next->next = head;
        head->next = nullptr;
        
        return tail;
    }
};