[LeetCode] Rotate Array

void rotate(vector<int>& nums, int k) 
{
	deque<int> dq;

	for (int j = 0; j < nums.size(); j++)
		dq.push_back(nums[j]);

	nums.clear();

	for (int i = 0; i < k; i++)
	{
		int val = dq.back();
		dq.pop_back();
		dq.push_front(val);
	}
	while (!dq.empty())
	{
		nums.push_back(dq.front());
		dq.pop_front();
	}
}