# 【LeetCode】Rotate Array 旋转数组

## 题目

### Rotate Array

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.

## 思路

1. 将数组从k位置分为前后两半；
2. 翻转前半部分；
3. 翻转后半部分；
4. 翻转整个数组；

## 解答

Java代码如下，注意遍历时候的边界不要出错：

    public void rotate(int[] nums, int k) {
if(k==0 || nums==null ) return;
k = k%nums.length;
int tmp;
for (int i = 0; i < (nums.length-k)/2; i++) {
tmp = nums[i];
nums[i] = nums[nums.length-k-1-i];
nums[nums.length-k-1-i] = tmp;
}
/*for (int i : nums) {
System.out.print(i+"-");
}
System.out.println();*/

for (int i = 0; i < k/2; i++) {
tmp = nums[i+nums.length-k];
nums[i+nums.length-k] = nums[nums.length-1-i];
nums[nums.length-1-i] = tmp;
}

/*for (int i : nums) {
System.out.print(i+" ");
}
System.out.println();*/

for (int i = 0; i < nums.length/2; i++) {
tmp = nums[i];
nums[i] = nums[nums.length-1-i];
nums[nums.length-1-i] = tmp;
}
}
09-12 2186

03-05 192
04-26 127
08-17 2332
08-21 2365
05-27 710
01-14 446
04-17 37
06-02 1326
08-17 286
09-06 1462