{leetcode}/problems/rotate-array/[LeetCode - Rotate Array^]
发现官网测试用例少了一个特殊情况：如果 k 大于两倍数组长度，提交的测试就会报错，但是官网却显示通过。
数组反转的方法也不错！反转时，直接使用界限的值进行加减比较简单省事！
Given an array, rotate the array to the right by k steps, where k is non-negative.
Example 1:
Input:[1,2,3,4,5,6,7]and k = 3 Output:[5,6,7,1,2,3,4]Explanation: rotate 1 steps to the right:[7,1,2,3,4,5,6]rotate 2 steps to the right:[6,7,1,2,3,4,5] `rotate 3 steps to the right: `[5,6,7,1,2,3,4]
Example 2:
Input: [-1,-100,3,99] and k = 2
Output: [3,99,-1,-100]
Explanation:
rotate 1 steps to the right: [99,-1,-100,3]
rotate 2 steps to the right: [3,99,-1,-100]
Note:
-
Try to come up as many solutions as you can, there are at least 3 different ways to solve this problem.
-
Could you do it in-place with O(1) extra space?
link:{sourcedir}/_0189_RotateArray.java[role=include]