Leetcode 61：Rotate List

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

Example 1:

Input: 1->2->3->4->5->NULL, k = 2
Output: 4->5->1->2->3->NULL
Explanation:
rotate 1 steps to the right: 5->1->2->3->4->NULL
rotate 2 steps to the right: 4->5->1->2->3->NULL
Example 2:

Input: 0->1->2->NULL, k = 4
Output: 2->0->1->NULL
Explanation:
rotate 1 steps to the right: 2->0->1->NULL
rotate 2 steps to the right: 1->2->0->NULL
rotate 3 steps to the right: 0->1->2->NULL
rotate 4 steps to the right: 2->0->1->NULL

C++
  ListNode* rotateRight(ListNode* head, int k) {
        if(head == nullptr)
            return nullptr;
        ListNode* cur = head;
        int n = 0;
        while(cur != nullptr)
        {
            cur = cur->next;
            n++;
        }
        k = k%n;
        ListNode* fastnode = head;
        ListNode* slownode = head;
        while(k--)
        {
            fastnode = fastnode->next;
        }
        while(fastnode->next != nullptr)
        {
            fastnode = fastnode->next;
            slownode = slownode->next;
        }
        fastnode->next = head;
        fastnode = slownode->next;
        slownode->next = nullptr;
        return fastnode;
    }