leetcode-61. Rotate List

https://leetcode.com/problems/rotate-list/#/description

问题描述：
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.

思路解析：主要是找到位置，第s个节点之后的链表需要移动到前面，
这个s =len-k%len；
然后就进行移动链表

代码如下：

/**
 * 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)return  head;

        ListNode d=new ListNode(0);

        d.next=head;

        ListNode s=d,f=d;

        int i;
        for(i=0;f.next!=null;i++)
        {
            f=f.next;
        }

        for(int j=0;j<i-k%i;j++){
            s=s.next;
        }

        f.next=d.next;
        d.next=s.next;
        s.next=null;

        return d.next;


    }
}