# 189. Rotate Array

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?

```cpp
// Using extra space
void rotate(vector<int>& nums, int k) { // time: O(n); space: O(n)
    vector<int> tmp = nums;
    int n = nums.size();
    for (int i = 0; i < n; ++i) {
        nums[(i + k) % n] = tmp[i];
    }
}
```

```cpp
// Constant version of the previous method
void rotate(vector<int>& nums, int k) { // time: O(n); space: O(1)
    if (nums.empty() || (k %= nums.size()) == 0) return;
    int start_idx = 0, idx = 0, pre = 0, cur = nums[0], n = nums.size();
    for (int i = 0; i < n; ++i) {
        pre = cur;
        idx = (idx + k) % n;
        cur = nums[idx];
        nums[idx] = pre;
        if (idx == start_idx) {
            start_idx = ++idx;
            cur = nums[start_idx];
        }
    }
}
```

```cpp
// Reverse method
void rotate(vector<int>& nums, int k) { // time: O(n); space: O(1)
    if (nums.empty() || ((k %= nums.size()) == 0)) return;
    int n = nums.size();
    reverse(nums.begin(), nums.end());
    reverse(nums.begin(), nums.begin() + k);
    reverse(nums.begin() + k, nums.end());
}
```

```cpp
// Reverse method
void rotate(vector<int>& nums, int k) { // time: O(n); space: O(1)
    if (nums.empty() || ((k %= nums.size()) == 0)) return;
    int n = nums.size();
    reverse(nums.begin(), nums.begin() + n - k);
    reverse(nums.begin() + n - k, nums.end());
    reverse(nums.begin(), nums.end());
}
```

```cpp
// Swap numbers to correct positions and keep doing so for the next part of array
void rotate(vector<int>& nums, int k) { // time: O(n); space: O(1)
    int n = nums.size(), start = 0;
    while (n && (k %= n)) {
        for (int i = 0; i < k; ++i) {
            swap(nums[i + start], nums[n - k + i + start]);
        }
        n -= k;
        start += k;
    }
}
```

{% content-ref url="../linked-list/61.-rotate-list" %}
[61.-rotate-list](https://jimmylin1991.gitbook.io/practice-of-algorithm-problems/linked-list/61.-rotate-list)
{% endcontent-ref %}


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://jimmylin1991.gitbook.io/practice-of-algorithm-problems/array/189.-rotate-array.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.