189. Rotation array

Give you an array , Rotate the elements in the array to the right k  A place , among  k  It is a non negative number .

Example 1:

 Input : nums = [1,2,3,4,5,6,7], k = 3
 Output : [5,6,7,1,2,3,4]
 explain :
 Rotate right  1  Step : [7,1,2,3,4,5,6]
 Rotate right  2  Step : [6,7,1,2,3,4,5]
 Rotate right  3  Step : [5,6,7,1,2,3,4]

Example  2:

 Input ：nums = [-1,-100,3,99], k = 2
 Output ：[3,99,-1,-100]
 explain : 
 Rotate right  1  Step : [99,-1,-100,3]
 Rotate right  2  Step : [3,99,-1,-100]

Tips ：

• 1 <= nums.length <= 105
• -231 <= nums[i] <= 231 - 1
• 0 <= k <= 105

class Solution {

public:

    void rotate(vector<int>& nums, int k) {

        int size = nums.size();

        vector<int>tmp=nums;

        tmp.insert(tmp.end(),nums.begin(),nums.end());

        nums = vector<int>(tmp.begin()+(size-k),tmp.end()-k);

    }

};