leetcode 92. 反转链表 II

力扣

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */
class Solution {
public:
    ListNode* reverseBetween(ListNode* head, int left, int right) {

        if (head == nullptr || head->next == nullptr) {
            return head;
        }

        ListNode *dummy = new ListNode(-1);
        dummy->next = head;
        ListNode *p = dummy;
        ListNode *prev, *start, *end, *next;
        for (int i = 0; i < right; i++) {
            if (i == left - 1) {
                prev = p;
                start = p->next;
            }
            p = p->next;
        }
        end = p; 
        next = p->next;
        end->next = nullptr;
        prev->next = reverseList(start);
        start->next = next;

        return dummy->next;
    }

    ListNode* reverseList(ListNode* head) {
        ListNode* prev = nullptr, *curr = head;
        while (curr != nullptr) {
            ListNode* next = curr->next;
            curr->next = prev;
            prev = curr;
            curr = next;
        }
        return prev;
    }
};