LeetCode 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.

AC代码：

void rotate(vector<int>& nums, int k)
{
int n = nums.size();
k = k % n;
reverse(nums.begin(),nums.end());
reverse(nums.begin(),nums.begin()+k);
reverse(nums.begin()+k,nums.end());

}这题主要就是reverse函数的运用，不知道的可以去复习下STL reverse函数，其次就是K>n的情况的考虑就行了。