Rotate List

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

For example:
Given 1->2->3->4->5->NULL and k = 2,
return 4->5->1->2->3->NULL.

Have you been asked this question in an interview? 

看别人思路：这个既然要rotate，不如先连起来loop，这样怎么也不怕null pointer exception了。然后再找到该断开的地方断开。
首先从head开始跑，直到最后一个节点，这时可以得出链表长度len。然后将尾指针指向头指针， 将整个圈连起来，接着往前跑len – k%len，从这里断开，就是要求的结果了。
有几点要注意：
1 k 可能大于list 长度，所以要mod
2

/**
 * 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) {
        if (head == null || n == 0) {
            return head;
        }
        //get length
        ListNode end =  head;
        int num = 1;
        while (end.next != null) {
            end = end.next;
            num ++;
        }
        n = num - (n % num);
        end.next = head;
        ListNode beforeHead = end;
        for (int i = 1; i <= n; i++) {
            beforeHead = head;
            head = head.next;
        }
        beforeHead.next = null;
        return head;
    }
}

/**
 * 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) {
        if (head == null || head.next == null  || n == 0) {
            return head;
        }
        int count = 0;
        ListNode dummy = new ListNode(-1);
        dummy.next = head;
        ListNode end =  head;
        int num = 1;
        while (end.next != null) {
            end = end.next;
            num ++;
        }
        n = num - (n % num);
        while (count < n) {
            ListNode temp = dummy.next;
            dummy.next = dummy.next.next;
            end.next = temp;
            end = end.next;
            end.next = null;
            count ++;
        }
        return dummy.next;
    }
}