本文共 600 字，大约阅读时间需要 2 分钟。
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; * next = null; * } * } */public class Solution { public ListNode rotateRight(ListNode head, int k) { if(null == head) return null; ListNode tail = head; int length = 1; while(tail.next != null){ length++; tail = tail.next; } for(int i =0;i 转载地址：http://dvuni.baihongyu.com/