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%nums.size() == 0)
        //     return;
        // for(int i=0;i<nums.size()-k%nums.size();i++){
        //     nums.push_back(nums[0]);
        //     nums.erase(nums.begin());
        // }
        
        //利用数组反转，前半部分反转，后半部分反转，再整体反转。
        k = k%nums.size();
        reverse(nums.begin(),nums.begin()+nums.size()-k);
        reverse(nums.begin()+nums.size()-k,nums.begin()+nums.size());
        reverse(nums.begin(),nums.end());
    }
};