[leetcode]61. Rotate List旋转链表
Given a linkedlist, rotate the list to the right bykplaces, wherekis 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 right: 5->1->2->3->4->NULL rotate 2 steps to the right: 4->5->1->2->3->NULL
Example 2:
Input: 0->1->2->NULL, k = 4 Output: 2->0->1->NULL Explanation: rotate 1 steps to the right: 2->0->1->NULL rotate 2 steps to the right: 1->2->0->NULL rotate 3 steps to the right: 0->1->2->NULL rotate 4 steps to the right: 2->0->1->NULL
题意：
给定一个链表， 循环移位k次。
优质内容筛选与推荐>>1、职业相关职位及职位能力要求知识点大纲范围
2、Spring Boot多数据源配置与使用
3、异常中断处理概述
4、node-sass 报错的解决方法
5、标题:a++和++a的区别