LeetCode之Reverse Linked List II

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
 /*改变链表的顺序，采用头插法即可。
 参考自：https://github.com/soulmachine/leetcode*/
class Solution {
public:
    ListNode *reverseBetween(ListNode *head, int m, int n) {
        ListNode newHead(-1);
        ListNode *pre = &newHead;
        pre->next = head;
        for(int i = 0; i < m - 1; ++i){
            pre = pre->next;
        }
        ListNode *cur = pre->next->next;
        ListNode *tail = pre->next;
        tail->next = nullptr;
        for(int i = 0; i < n - m; ++i){//头插法
            ListNode *tmp = cur;
            cur = cur->next;
            tmp->next = pre->next;
            pre->next = tmp;
        }
        if(cur != nullptr) tail->next = cur;
        return newHead.next;
    }
};