leetcode reverse-linked-list-ii

Reverse a linked list from position m to n. Do it in-place and in one-pass.
For example:
Given1->2->3->4->5->NULL, m = 2 and n = 4,
return1->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;
        int count = 0;
        ListNode * Head = new ListNode(-1), * pre = Head;
        Head->next = head;
        for (int i=0;i<m-1;i++)
            pre = pre->next;
        ListNode * cur = pre->next->next, * end = pre->next;
        while(NULL != cur)
        {
            ListNode * tmp = cur->next;       
            cur->next = pre->next;
            pre->next = cur;
            cur = tmp;
            count++;
            if (count == n-m)
                break;
        }
        end->next = cur;
        return Head->next;
    }
};

测试

#include<iostream>
using namespace std;

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;
        int count = 0;
        ListNode * Head = new ListNode(-1), * pre = Head;
        Head->next = head;
        for (int i=0;i<m-1;i++)
            pre = pre->next;
        ListNode * cur = pre->next->next, * end = pre->next;
        while(NULL != cur)
        {
            ListNode * tmp = cur->next;       
            cur->next = pre->next;
            pre->next = cur;
            cur = tmp;
            count++;
            if (count == n-m)
                break;
        }
        end->next = cur;
        return Head->next;
    }
};

ListNode * makelist(int A[], int n)
{
    ListNode *root = new ListNode(0);
    ListNode *tmp = root;
    for (int i=0;i<n;i++)
    {
        tmp->next = new ListNode(A[i]);
        tmp = tmp->next;
    }
    return root->next;
}
void printlist(ListNode * root) 
{
    ListNode * p = root;
    while(NULL != p)
    {
        cout<<" "<<p->val;
        p = p->next;
    }
    cout<<endl;
}

int main ()
{
    Solution s;
    int A[] = {1,2,3,4,5,6};
    ListNode *root = makelist(A, 5);
    printlist(root);
    ListNode *root1 = s.reverseBetween(root, 4, 5);
    printlist(root1);
}