相似题目：旋转数组

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.

代码：

解题思路：组成环形链表，然后找到头结点。