LeetCode - 92. 反转链表 II

最新推荐文章于 2024-09-14 18:52:56 发布

virgilshi

最新推荐文章于 2024-09-14 18:52:56 发布

阅读量120

点赞数

分类专栏： LeetCode 文章标签： leetcode 链表

本文链接：https://blog.csdn.net/whutshiliu/article/details/105125768

版权

LeetCode 专栏收录该内容

297 篇文章 3 订阅

订阅专栏

92. 反转链表 II

反转从位置 m 到 n 的链表。请使用一趟扫描完成反转

说明:
1 ≤ m ≤ n ≤ 链表长度。
在这里插入图片描述
解题思路： 解此题的关键是如何将链表翻转，一般情况下，链表反转有两种方法：头插法和顺次反转。这里把两种解法都贴出来。

头插法

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* reverseBetween(ListNode* head, int m, int n) {
        ListNode *dummy = new ListNode(-1), *cur = dummy;
        dummy->next = head;
        for (int i = 0; i < m - 1; ++i) cur = cur->next;
        ListNode *p = cur;
        cur = cur->next;
        for (int i = 0; i < n - m; ++i) {
            ListNode *tmp = cur->next;
            cur->next = cur->next->next;
            tmp->next = p->next;
            p->next = tmp;
        }
        head = dummy->next;
        delete dummy;
        return head;
    }
};

顺次反转

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* reverseBetween(ListNode* head, int m, int n) {
        ListNode *cur = head, *last = NULL, *pre = NULL, *prev = NULL, *next;
        for (int i = 0; i < m - 1; ++i) {
            prev = cur;
            cur = cur->next;
        }
        last = cur;
        for (int i = 0; i <= n - m; ++i) {
            next = cur->next;
            cur->next = pre;
            pre = cur;
            cur = next;
        }
        last->next = next;
        if (prev) prev->next = pre;
        return m == 1 ? pre : head;
    }
};