LeetCode(92) Reverse Linked List II

参考code_ganker的文字，写出算法。
代码如下：

/**
 * 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) {

        ListNode *pmPre, *pm, *pn;

        ListNode *newHead = new ListNode(0);
        newHead->next = head;

        int counter = 0;
        ListNode *p1 = newHead;
        while(p1 != NULL) {

            if(counter == (m - 1))

                pmPre = p1;

            if(counter == m)

                pm = p1;

            if(counter == n)

                pn = p1;

            p1 = p1->next;
            counter++;

        }

        ListNode *pnNext = pn->next;

        p1 = pm->next;
        while(p1 != pnNext) {

            ListNode *tmp = p1->next;
            ListNode *tmpP1 = p1;
            pmPre->next = p1;
            p1->next = pm;

            ListNode *p2 = pm;
            while(p2->next != tmpP1)

                p2 = p2->next;

            p2->next = tmp;

            pm = pmPre->next;
            p1 = tmp;

        }

        return newHead->next;

    }
};