LeetCode 189. Rotate Array

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