高频题
链表里面很多小细节
class Solution {
public ListNode rotateRight(ListNode head, int k) {
if(head == null) return head;
int n = 0;
ListNode tmp = head;
while(tmp != null){
tmp = tmp.next;
n ++;
}
k = k % n;
ListNode fast = head;
ListNode slow = head;
for(int i = 0; i < k; i ++) fast = fast.next;
while(fast.next != null){
fast = fast.next;
slow = slow.next;
}
fast.next = head;
ListNode ans = slow.next;
slow.next = null;
return ans;
}
}