LeetCode 61 - Rotate List

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.

My Code

/**
 * 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 || k == 0)
            return head;

        int len = 1;
        ListNode *tail = head;
        while (tail->next != NULL)
        {
            tail = tail->next;
            len++;
        }

        k = k % len;
        if (k == 0)
            return head;

        ListNode *targetNode = head, *previousNode = NULL;
        for (int i = 0; i < len - k; i++)
        {
            previousNode = targetNode;
            targetNode = targetNode->next;
        }

        tail->next = head;
        previousNode->next = NULL;
        head = targetNode;

        return head;
    }
};

Runtime: 8 ms