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) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if (m == n) {
            return head;
        }
        int count = 0;
        ListNode *cur = head;
        ListNode *pre = head;
        ListNode *p = head;
        ListNode *t = NULL;
        ListNode *tail = head;
        while (count < n && p) {
            if (count > 0 && count < m-1) {
                pre = pre->next;
            }
            if (count < m-1) {
                cur = cur->next;
                tail = tail->next;
            }
            if (count >= m) {
                t = p;
                p = p->next;
                t->next = cur;
                cur = t;
            } else {
               p = p->next;
            }
            ++count;
        }
        if (tail != p) {
          tail->next = p;
        }
        if (tail == head) {
            head = cur;
        } else {
            pre->next = cur;
        }
        return head;
    }
};