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. 对链表从右侧k个数进行翻转。 注意：k可以大于链表的长度，需要对链表长度