LeetCode 61. Rotate List（旋转链表）

原题网址：https://leetcode.com/problems/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.

方法：统计链表长度。

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    public ListNode rotateRight(ListNode head, int k) {
        if (head == null || head.next == null || k==0) return head;
        int len = 1;
        ListNode tail = head;
        while (tail.next != null) {
            tail = tail.next;
            len ++;
        }
        k = k % len;
        if (k==0) return head;
        ListNode node = head;
        int pos = 0;
        while (pos < len - k - 1) {
            node = node.next;
            pos ++;
        }
        ListNode rotated = node.next;
        node.next = null;
        tail.next = head;
        return rotated;
    }
}