Leetcode92:反转链表Ⅱ

题目描述：

给你单链表的头指针 head 和两个整数 left 和 right ，其中 left <= right 。请你反转从位置 left 到位置 right 的链表节点，返回 反转后的链表 。

示例1：

输入：head = [1,2,3,4,5], left = 2, right = 4
输出：[1,4,3,2,5]

示例 2：

输入：head = [5], left = 1, right = 1
输出：[5]

提示：

• 链表中节点数目为 n

• 1 <= n <= 500

• -500 <= Node.val <= 500

• 1 <= left <= right <= n

切出子链表，进行反转，再连回去

class Solution {
private:
    void reverseList(ListNode *head){
        ListNode* pre = nullptr;
        ListNode* cur = head;
        while(cur!=nullptr){
            ListNode* next = cur->next;
            cur->next = pre;
            pre = cur;
            cur = next;
        }
    }
public:
    ListNode* reverseBetween(ListNode* head, int left, int right) {
        ListNode* dummyNode = new ListNode(-1);
        dummyNode->next=head;
        ListNode* pre = dummyNode;
        for(int i=0;i<left-1;i++){
            pre = pre->next;
        }
        ListNode*rightNode = pre;
        for(int i=0;i<right-left+1;i++){
            rightNode = rightNode->next;
        }
        ListNode* leftNode = pre->next;
        ListNode* curr = rightNode->next;
        pre->next = nullptr;
        rightNode->next=nullptr;
        reverseList(leftNode);
        pre->next = rightNode;
        leftNode->next = curr;
        return dummyNode->next;
    }
};