61. 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.

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    public ListNode rotateRight(ListNode head, int k) {
        if(head == null) return head;
        ListNode dummy = new ListNode(0);
        dummy.next = head;
        int len = 0;
        ListNode node = dummy;
        while(node.next != null){
            len++;
            node = node.next;
        }
        k %= len;
        k = len - k;
        ListNode slow = dummy;
        for(int i = 0; i < k; i++) slow = slow.next;
        node.next = dummy.next;
        dummy.next = slow.next;
        slow.next =  null;
        return dummy.next;
    }

}