Leetcode: Rotate List

Given a list, rotate the list to the right by k places, where k is non-negative.

For example:
Given 1->2->3->4->5->NULL and k = 2,
return 4->5->1->2->3->NULL.

c++:

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode *rotateRight(ListNode *head, int k) {
        if(head == NULL)
        {
            return NULL;
        }
        ListNode *p = head;
        int count = 0;
        while(p)
        {
            count ++;
            p = p->next;
        }
        k %= count;
        if(k == 0)
        {
            return head;
        }
        k = count - k;
        ListNode dump = ListNode(-1);
        ListNode *q = &dump;
        p = head;
        ListNode *pre = head;
        while(k --)
        {
            pre = p;
            p = p->next;
        }
        q->next = p;
        while(p->next != NULL)
        {
            p = p->next;
        }
        p->next = head;
        pre->next = NULL;
        return dump.next;
    }
};