### Question

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.

Related problem: Reverse Words in a String II

**Credits:**

Special thanks to @Freezen for adding this problem and creating all test cases.

### Solution

This question is very standard “rotate 3 times” solution.

### Code

```
public class Solution {
public void rotate(int[] nums, int k) {
if (nums == null || nums.length == 0) {
return;
}
int len = nums.length;
k = k % len;
reverse(nums, 0, len - k - 1);
reverse(nums, len - k, len - 1);
reverse(nums, 0, len - 1);
}
void reverse(int[] nums, int start, int end) {
while (start < end) {
int temp = nums[start];
nums[start] = nums[end];
nums[end] = temp;
start++;
end--;
}
}
}
```