189. 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) {
        vector<int> tmp;
        int len = nums.size();
        k = k % len;
        for(int i = len-k; i < len; i++)
        {
            tmp.push_back(nums[i]);
        }
        for(int j = 0; j < len-k; j++)
        {
            tmp.push_back(nums[j]);
        }
        for(int k = 0; k < len; k++)
        {
            nums[k] = tmp[k];
        }
    }
};