# 189. Rotate Array

## 1.問題

![](https://901207480-files.gitbook.io/~/files/v0/b/gitbook-legacy-files/o/assets%2F-LGKoChvN9am4__HCIRK%2F-LKX-eX0Y5StL_kK1Oa4%2F-LKX0GVrZZ_iay6YMl7o%2F%E8%9E%A2%E5%B9%95%E5%BF%AB%E7%85%A7%202018-08-22%20%E4%B8%8B%E5%8D%8810.23.25.png?alt=media\&token=806f3088-bf74-4340-8a71-ff06244914d4)

## 2.想法

## 3.程式碼

```
class Solution {
public:
    void rotate(vector<int>& nums, int k) {
        if (k == 0)
        {
            return;
        }
        k = k % nums.size();
        for (int i = 0 ; i < k ; i++)
        {
            nums.insert(nums.begin(), nums.back());
            nums.pop_back();
        }
    }
};
```

## 4.Performance

![](https://901207480-files.gitbook.io/~/files/v0/b/gitbook-legacy-files/o/assets%2F-LGKoChvN9am4__HCIRK%2F-LKX-eX0Y5StL_kK1Oa4%2F-LKX0rhS93rmCYNE_Jmv%2F%E8%9E%A2%E5%B9%95%E5%BF%AB%E7%85%A7%202018-08-22%20%E4%B8%8B%E5%8D%8810.26.01.png?alt=media\&token=28ee10e9-260c-4816-ade0-c3ffadcf034c)