Leetcode 92. Reverse Linked List II

最新推荐文章于 2025-05-21 15:08:20 发布

原创最新推荐文章于 2025-05-21 15:08:20 发布 · 147 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#Leetcode

Leetcode 同时被 2 个专栏收录

409 篇文章

订阅专栏

Algorithm

260 篇文章

订阅专栏

本文介绍了一种算法，用于在给定的起始和结束位置之间反转单链表的一部分。通过迭代方式实现，调整指针连接以完成反转操作，同时保持链表其余部分不变。

文章作者：Tyan
博客：noahsnail.com | 优快云 | 简书

1. Description

Reverse Linked List II

2. Solution

/**
 * 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) {
        if(m == n) {
            return head;
        }
        ListNode* start = nullptr;
        ListNode* end = nullptr;
        ListNode* left = nullptr;
        ListNode* right = nullptr;

        ListNode* pre = nullptr;
        ListNode* current = head;
        ListNode* next = nullptr;
        int diff = n - m + 1;
        m--;
        while(m) {
            pre = current;
            current = current->next;
            m--;
        }
        start = pre;
        right = current;
        while(diff) {
            next = current->next;
            current->next = pre;
            pre = current;
            current = next;
            diff--;
        }
        left = pre;
        end = current;
        right->next = end;
        if(start) {
            start->next = left;
            return head;
        }
        else {
            return left;
        } 
    }
};