Appearance
61. 旋转链表
原题链接：LeetCode 61. 旋转链表
题目描述
给你一个链表的头节点 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 <= 100`
0 <= k <= 2 * 109
难度： Medium
题解代码
javascript
/**
* Definition for singly-linked list.
* function ListNode(val, next) {
* this.val = (val===undefined ? 0 : val)
* this.next = (next===undefined ? null : next)
* }
*/
/**
* @param {ListNode} head
* @param {number} k
* @return {ListNode}
*/
var rotateRight = function(head, k) {
if (!head || !k || !head.next) return head
let p = head, num = 0
while (p) {
num++
p = p.next
}
if (!(k % num)) return head
let slow = fast = head
let count = 0
while (fast && fast.next) {
fast = fast.next
if (count >= (k % num)) {
slow = slow.next
}
count++
}
const next = slow.next
slow.next = null
fast.next = head
return next
};