LeetCode 61. Rotate List | 翻转k次链表

翻转链表 Given a linked list, rotate the list to the right by k places, where k is non-negative. Example 1: Input: 1->2->3->4->5->NULL, k = 2 Output: 4->5->1->2->3->NULL Explanation: rotate 1 steps to the

>>阅读原文<<