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) {
        int m = nums.size();
        k=m-k%m;
        for(int i=0;i<k;i++){
            nums.push_back(nums[0]);
            nums.erase(nums.begin());
        }
    }
};