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.

Difficulty: Medium

/**
 * 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 null;
        int len = 0;
        ListNode curr = head;
        ListNode tail = null;
        while(curr != null){
            len++;
            tail = curr;
            curr = curr.next;
        }
        k = k%len;
        if(k == 0) return head;
        k = len - 1 - k;
        tail.next = head;
        curr = head;
        while(k > 0){
            curr = curr.next;
            k--;
        }
        head = curr.next;
        curr.next = null;
        return head;
        
    }
}