LeetCode || Rotate Array

class Solution {public:    void rotate(vector<int>& nums, int k) {                k = k % nums.size();        vector<int> tmp;        int n = nums.size();        for(int i = n-1;i>=n-k && i >=0;i--)            tmp.push_back(nums[i]);                //move to the back        for(int i = n-k-1;i>=0;i--)            nums[i+k] = nums[i];                for(int i = 0;i<k;i++)            nums[i] = tmp[k-i-1];    }};