【leetcode206】206. Reverse Linked List 反转链表

最新推荐文章于 2022-09-01 20:35:44 发布

fisty

最新推荐文章于 2022-09-01 20:35:44 发布

阅读量226

点赞数 1

分类专栏： leetcode

本文链接：https://blog.csdn.net/u013008291/article/details/81364465

版权

leetcode 专栏收录该内容

8 篇文章 0 订阅

订阅专栏

Reverse a singly linked list.

Example:

Input: 1->2->3->4->5->NULL
Output: 5->4->3->2->1->NULL

迭代版

/**
 * 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 || !head->next) return head;
        ListNode* tail = head;
        ListNode* cur = tail->next;
        ListNode* next = cur;
        tail->next = NULL;
        while(next != NULL){
            next = cur->next;
            cur ->next = tail;
            tail = cur;
            cur = next;
        }
        return tail;
    }
};

递归版:

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