leetcode61 java 旋转链表

···

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode() {}
 *     ListNode(int val) { this.val = val; }
 *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
 * }
 */
class Solution {
    public ListNode rotateRight(ListNode head, int k) {
        ListNode temp=head;
        if(head==null||head.next ==null||k==0)return head;
        int len =1;
        while(temp.next!=null){
            temp =temp.next;
            len++;
            }
        temp.next =head;//循环链表了
        k = k%len;
        // 找到尾节点
        for(int i=0;i< (len)-k;i++){
            temp = temp.next;
        }
        head = temp.next;
        temp.next =null;
        return head;

    }
}