[leetcode] 189. Rotate Array 解题报告

题目链接：https://leetcode.com/problems/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.

思路：三次翻转即可

代码如下：

class Solution {
public:
    void rotate(vector<int>& nums, int k) {
        if(k <= 0) return;
        k = k% nums.size();
        reverse(nums.begin(),nums.end()-k);
        reverse(nums.end()-k, nums.end());
        reverse(nums.begin(), nums.end());
    }
};