标签：
1 题目
Rotate an array of n elements to the right by k steps.
For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4].
Note:
Try to come up as many solutions as you can, there are at least 3 different ways to solve this problem.
Credits:
Special thanks to @Freezen for adding this problem and creating all test cases.
Array
public void rotate(int[] nums,int k) { int len = nums.length; k %= len;//很重要防止k超过len this.partRotate(nums, 0, len - k); this.partRotate(nums, len - k, len);//至于为什么不是len － k － 1与下面的实现有关吧 this.partRotate(nums, 0, len); } public int[] partRotate(int[] nums, int head, int rear) { int temp = 0; for (int i = 0; i < (rear - head) / 2; i++) { temp = nums[head + i]; nums[head + i] = nums[rear - i - 1]; nums[rear - i - 1] = temp; } return nums; }
标签：
原文地址：http://www.cnblogs.com/lingtingvfengsheng/p/4308405.html
