[LeetCode] Rotate Array

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.

[show hint]

Hint:
Could you do it in-place with O(1) extra space?

 

解法1：1.旋转整个数组： [1,2,3,4,5,6,7] => [7,6,5,4,3,2,1]

　　　  2.旋转前k个数：[7,6,5,4,3,2,1] => [5,6,7,4,3,2,1]

　　　  3.旋转后n-k个数：[5,6,7,4,3,2,1] => [5,6,7,1,2,3,4]

　　　　时间复杂度O(n), 空间复杂度O(1)

class Solution {
public:
    void rotate(int nums[], int n, int k) {
        if (nums == NULL || n <= 0 || k <= 0)
            return;
         k %= n;
        reverse(nums, 0, n - 1);
        reverse(nums, 0, k - 1);
        reverse(nums, k, n - 1);
    }
    
    void reverse(int nums[], int begin, int end) {
        if (begin >= end) return;
        while (begin < end) {
            swap(nums[begin++], nums[end--]);
        }
    }
};

 解法2：参考https://oj.leetcode.com/discuss/26088/solutions-with-extra-memory-dont-know-the-third-one-yet-idea的answer
　　

class Solution {
public:
    void rotate(int nums[], int n, int k) {
        if (nums == NULL || n <=0 || k <= 0)
            return;
        k %= n;
        int index = 0;
        int cycle = 0;
        int next = 0;
        int temp = nums[next];
        for (int i = 0; i < n; ++i) {
            next = (next + k) % n;
            swap(nums[next], temp);
            if (cycle == next) {
                next++;
                cycle = next;
                temp = nums[next];
            }
        }
    }
};

更多解法:https://leetcode.com/discuss/27387/summary-of-c-solutions