LeetCode - 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 *prev=head,*begin=head;
		int counter=1;
		if(m==1){
			prev=new ListNode(0);
			prev->next=head;
			begin=head;
		}else{
			while(begin&&counter<m){
				prev=begin;
				begin=begin->next;
				counter++;
			}
		}
		if(begin){
			ListNode *p=begin->next;
			while(p&&counter<n){
				begin->next=p->next;
				p->next=prev->next;
				prev->next=p;
				p=begin->next;
				counter++;
			}
		}
		if(m==1){
			head=prev->next;
			delete prev;
			prev=NULL;
		}
		return head;
    }
};