Leetcode 92. Reverse Linked List II

Reverse a linked list from position m to n. Do it in-place and in one-pass.

For example:
Given 1->2->3->4->5->NULL, m = 2 and n = 4,

return 1->4->3->2->5->NULL.

Note:
Given m, n satisfy the following condition:
1 ≤ m ≤ n ≤ length of list.

/**
 * 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* dummyHead = new ListNode(0);
        dummyHead->next = head;
        ListNode* p = dummyHead;
        ListNode* tail;
        ListNode* begin;
        ListNode* end;
        ListNode* last;
        ListNode* next;
        ListNode* head2;

        // 加了head后第n个是tail 走n - 1 步
        for (size_t i = 0; i != (m - 1); ++i) {
            p = p->next;
        }
        tail = p;

        p = p->next;
        end = p;
        // 共 (m - n + 1) , 处理 (m - n + 1) 步

        for (size_t i = 0; i != n - m + 1; ++i) {
            next = p-> next;
            p->next = last;
            last = p;
            p = next;
        }
        begin = last;
        ListNode *tmp = begin->next;
        head2 = p;
        tail->next = begin;
        end->next = head2;
       return dummyHead->next;
    }
};