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.
1 class Solution 2 { 3 public: 4 void rotate(vector<int>& nums, int k) 5 { 6 int n = nums.size(); 7 8 if (n == 0 || k % n == 0) 9 { 10 return; 11 } 12 13 k %= n; 14 15 std::reverse(nums.begin(), nums.begin() + n - k); 16 std::reverse(nums.begin() + n - k, nums.end()); 17 std::reverse(nums.begin(), nums.end()); 18 } 19 };
原文：http://www.cnblogs.com/lijiatu/p/5370411.html