【leetcode】Reverse Nodes in k-Group

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:

    /**
     * Reverse a link list between pre and next exclusively
     * an example:
     * a linked list:
     * 0->1->2->3->4->5->6
     * |           |   
     * pre        next
     * after call pre = reverse(pre, next)
     * 
     * 0->3->2->1->4->5->6
     *          |  |
     *          pre next
     * @param pre 
     * @param next
     * @return the reversed list's last node, which is the precedence of parameter next
     */
    ListNode *reverse(ListNode *pre,ListNode *next)
    {
       ListNode *last=pre->next;
       ListNode *cur=last->next;
       while(cur!=next)
       {
           last->next=cur->next;
           cur->next=pre->next;
           pre->next=cur;
           
           cur=last->next;
       }
       return last;
    }

    ListNode *reverseKGroup(ListNode *head, int k) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if(head==NULL||k==1)
            return head;
        
        ListNode *dummy=new ListNode(0);
        dummy->next=head;
        ListNode *pre=dummy;
        
        int i=0;
        while(head!=NULL)
        {
            i++;
            if(i%k==0)
            {
                pre=reverse(pre,head->next);
                //the reverse part,and because pre==dummy,so reverse(pre,head->next) will change dummy->next
                
                head=pre->next;
            }
            else
                head=head->next;
        }   
        return dummy->next;
    }
};