Cacher is the code snippet organizer for pro developers

/**
 * 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;
 *         next = null;
 *     }
 * }
 */
 
/**
 * The basic idea is to link the tail of the list with the head, make it a cycle. Then count to the rotate point and cut it.
 */

public class Solution {
    public ListNode rotateRight(ListNode head, int n) {
        if (head == null)
            return head;
    
        ListNode copyHead = head;
    
        int len = 1;
        while (copyHead.next != null) {
            copyHead = copyHead.next;
            len++;
        }
    
        copyHead.next = head;
    
        for (int i = len - k % len; i > 1; i--)
            head = head.next;
    
        copyHead = head.next;
        head.next = null;
    
        return copyHead;
    }
}