leetcode_70 Rotate Array

题目：

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

Follow up:

• Try to come up as many solutions as you can, there are at least 3 different ways to solve this problem.
• Could you do it in-place with O(1) extra space?

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]

 

Constraints:

• 1 <= nums.length <= 2 * 10^4
• It's guaranteed that nums[i] fits in a 32 bit-signed integer.
• k >= 0

算法解析：

Using Cyclic Replacements 使用循环替换

循环的次数比较难确定，example 1 循环1次，替换所有；example 2 循环 k 次（n能被2整除）；

用例 [1,2,3,4,5,6]   4  循环两次； 没什么规律可循，就对循环替换的元素计数，替换元素个数等于数组长度终止；

内层迭代终止条件，回到起点

 

代码如下：

class Solution {
public:
    void rotate(vector<int>& nums, int k) {
     int n = nums.size();
     if(n == 0 || k % n == 0)
         return;
     k = k % n;
     int count = 0; 
     for(int i = 0; count < n; i++){
        int index = i,next = n;
        int temp1 = nums[i];
        int temp2;
        while(next != i){
            next = (index + k) % n;
            temp2 = nums[next];
            nums[next] = temp1;
            index = next;
            temp1 = temp2;
            count++;
        }
     }
    }
};