Given the head of a linked list, rotate the list to the right by k places.
Example 1:
Input: head = [1,2,3,4,5], k = 2
Output: [4,5,1,2,3]
Explanation: After rotating right by 1: [5,1,2,3,4]. After rotating right by 2: [4,5,1,2,3].
Example 2:
Input: head = [0,1,2], k = 4
Output: [2,0,1]
Explanation: k=4 is equivalent to k=1 (since 4 % 3 = 1). After rotating right by 1: [2,0,1].
Example 3:
Input: head = [1], k = 1
Output: [1]
Explanation: A single-node list is unchanged by any rotation.
[0, 500]-100 <= Node.val <= 1000 <= k <= 2 * 10⁹