leetcode 189. 轮转数组

题目描述

代码：

class Solution {
public:void rotate(vector<int>& nums, int k) {int len = nums.size();k = k % len;reverse(nums,0,len-1);reverse(nums,0,k-1);reverse(nums,k,len-1);}void reverse(vector<int>& nums,int left,int right){while(left < right){swap(nums[left],nums[right]);left++;right--;}}
};