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.

[show hint]

Hint:

Could you do it in-place with O(1) extra space?

题意：假设数组是循环数组，那么计算将数组循环移动k项后的情况。

思路：循环移动。

class Solution {
public:
	void rotate(vector<int>& nums, int k) {
		if (nums.empty())
			return;
		k %= nums.size();
		while (k--){
			int a = nums[nums.size() - 1];
			nums.erase(nums.end()-1);
			nums.insert(nums.begin(), a);
		}
		return;
	}
};