给你一个链表的头节点 head ，旋转链表，将链表每个节点向右移动 k 个位置。
示例 1：
输入：head = [1,2,3,4,5], k = 2
输出：[4,5,1,2,3]示例 2：
输入：head = [0,1,2], k = 4
输出：[2,0,1]提示：
- 链表中节点的数目在范围
[0, 500]内 -100 <= Node.val <= 1000 <= k <= 2 * 109
class Solution {
public ListNode rotateRight(ListNode head, int k) {
if (head == null || head.next == null || k == 0) {
return head;
}
ListNode curHead = head;
List<ListNode> list = new ArrayList<>();
while(curHead != null) {
list.add(curHead);
curHead = curHead.next;
}
int r = k % list.size();
if (r == 0) return head;
list.get(list.size() - r - 1).next = null;
list.get(list.size() - 1).next = list.get(0);
head = list.get(list.size() - r);
return head;
}
}
