[leetcode]189. Rotate Array

解法一：超时

class Solution {
public:
    void rotate(vector<int>& nums, int k) {
        int n=nums.size();
        for(int i=0;i<k;i++)
        {
            int temp=nums[n-1];
            for(int j=n-2;j>=0;j--)
            {
                nums[j+1]=nums[j];
            }
            nums[0]=temp;
        }
    }
};

解法二

class Solution {
public:
    void rotate(vector<int>& nums, int k) {
        int n=nums.size();
        k%=n; //必不可少
        reverse(nums.begin(),nums.begin()+n-k);//include<algorithm>
        reverse(nums.begin()+n-k,nums.end());//注意 左闭右开【 )
        reverse(nums.begin(),nums.end());
    }
};