Reverse a linked list from position m to n, in-place and in one pass
This is hard to read and follow:

    ListNode *pre=NULL, *cur=head, *front=NULL, *rear=NULL,*follow=head-&gt;next;


One variable per line:

This is really hard to read:

while(cur!=NULL&amp;&amp;subLoop--&gt;=0)


Not sure what the --&gt; operator does :-(

Your code could really do with a lot more white space between operators to make it readable.

To be honest I can not follow the logic of this function. Especially since I have not idea what the input parameters are supposed to represent:

ListNode *reverseBetween(ListNode *head, int m, int n)


What are m and n for?