189. Rotate Array

Given an array, rotate the array to the right by k steps, where k is non-negative.

Example 1:

Input: nums = [1,2,3,4,5,6,7], k = 3
Output: [5,6,7,1,2,3,4]
Explanation:
rotate 1 steps to the right: [7,1,2,3,4,5,6]
rotate 2 steps to the right: [6,7,1,2,3,4,5]
rotate 3 steps to the right: [5,6,7,1,2,3,4]

Example 2:

Input: nums = [-1,-100,3,99], k = 2
Output: [3,99,-1,-100]
Explanation: 
rotate 1 steps to the right: [99,-1,-100,3]
rotate 2 steps to the right: [3,99,-1,-100]

class Solution {
public:
    void rotate(vector<int>& nums, int k) {
        int t = nums[0], len=nums.size(), pre;
        if (nums.empty() || (k %= len) == 0) return;
        int index = 0,start = 0,index1;
        pre = nums[index];
        for (int i = 0; i<nums.size() ; i++){
            index1 = (index+k)%len;
            t = nums[index1];
            nums[index1] = pre;
            pre = t;
            index = index1;
            if (index == start){
                index = ++start;
                pre = nums [index];
            }
        }
        
    }
};