leetcode #61 rotate list

Given a linked list, rotate the list to the right by k places, where k is non-negative.

Example 1:

Input: 1->2->3->4->5->NULL, k = 2
Output: 4->5->1->2->3->NULL
Explanation:
rotate 1 steps to the right: 5->1->2->3->4->NULL
rotate 2 steps to the right: 4->5->1->2->3->NULL
Example 2:

Input: 0->1->2->NULL, k = 4
Output: 2->0->1->NULL
Explanation:
rotate 1 steps to the right: 2->0->1->NULL
rotate 2 steps to the right: 1->2->0->NULL
rotate 3 steps to the right: 0->1->2->NULL
rotate 4 steps to the right: 2->0->1->NULL

思路
本题除了需要注意two pointers的运行边界情况之外，还需要特别注意几个特殊情况：1）链表本身为空；2）k值大于链表的长度；3）更新后的k值为0。本题的时间复杂度为O(n)，空间复杂度为O(1)。
添加链接描述

非常喜欢的一题帮助我更好的理解链表
fast slow 两个指针
fast先向后移动k个
然后两个同时移动至fast到最后一个
然后slow。next 为head
fast连接原来的head

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public ListNode rotateRight(ListNode head, int k) {
          if(head == null||k<=0){
            return head;
        }
        
        
        ListNode tmp = new ListNode(0);
        tmp.next = head;
        ListNode fast = tmp;
        ListNode slow = tmp;
        int len = 0;
        
       while(slow.next!=null){ //获取链表长度
           len++;
           slow= slow.next;
       }
        slow = tmp;
        
        k = k%len; //k可能大于length
        
        if(k==0){
            return tmp.next;
        }
        for(int i= 0;i<k;i++ ){ //快指针先走k步
            fast = fast.next;
        }
        while(fast.next !=null){
            fast = fast.next;
            slow = slow.next;
        }
        
        tmp.next = slow.next;
        fast.next = head;
        slow.next = null;//防止他成为一个循环链表
        
        
        return tmp.next;
        
    }
}