LeetCode:Rotate Array

Problem:

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.

Solution:问题意思是要将末尾的数字依次右移 总共移动三次 则是左移n-k%n 采用三步反转。

class Solution {
public:
    void rotate(vector<int>& nums, int k) {
        int n=nums.size();
        int m=n-k%n;
        reverse(nums,0,m-1);
        reverse(nums,m,n-1);
        reverse(nums,0,n-1);
        
    }
    void reverse(vector<int>& nums,int from,int to)
    {
        while(from<to)
        {
            int temp=nums[from];
            nums[from++]=nums[to];
            nums[to--]=temp;
        }
    }
};