61. Rotate List

Total Accepted: 96273
Total Submissions: 399212
Difficulty: Medium
Contributors: Admin

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

.

来源： https://leetcode.com/problems/rotate-list/

分析

这里题目的 test case 有一个没有说清楚的条件，就是当 k > list.size ，怎么处理， 实际上题目是取模的 null