链接: https://oj.leetcode.com/problems/rotate-list/
/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { * val = x; * next = null; * } * } */ public class Solution { public ListNode rotateRight(ListNode head,int n) { int l=0; //链表长度 ListNode pos=head; if(pos==null) return pos; while(pos.next!=null) { l++; pos=pos.next; } l+=1; pos.next=head; //头节点 pos=head; for(int i=0;i<l-n%l-1;i++) { pos=pos.next; } head=pos.next; pos.next=null; return head; } };