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]

Credits:

Special thanks to @Freezen for adding this problem and creating all test cases.

Solution 1:

class Solution {
public:
    void rotate(int nums[], int n, int k) {
        k = k%n;
        for(int back = n-k; back < n; back++)
        {
            int temp = nums[back];
            int front = back;
            while(front > back - (n-k))
            {
                nums[front] = nums[front-1];
                front--;
            }
            nums[front] = temp;
        }
    }
};

Solution 2:

class Solution {
public:
    void rotate(int nums[], int n, int k) {
        k = k%n;
        int loop = 0;
        int index = 0;
        int cur = nums[0];
        int count = 0;
        while(loop < n)
        {
            int move = (index + k) % n;
            int temp = nums[move];
            nums[move] = cur;
            cur = temp;
            index = move;
            loop++;
            count += k;
            if(count % n == 0)
            {
                index++;
                cur = nums[index];
                count = 0;
            }
        }
    }
};

Solution 3:

class Solution {
public:
void reverse(int nums[], int left, int right) {
    while(left < right)
    {
        int temp = nums[left];
        nums[left] = nums[right];
        nums[right] = temp;
        left++;
        right--;
    }
  }
 
void rotate(int nums[], int n, int k) {
  k = k % n;
  reverse(nums, 0, n-1);
  reverse(nums, 0, k-1);
  reverse(nums, k, n-1);
}
};

Round 3:

class Solution {
public:
    void rotate(vector<int>& nums, int k) {
		if(k <= 0 || nums.size() <= 1)
			return;
		k = k % nums.size();
		int index = 0;
		int preValue = nums[0];
		int count = 0;
		for(int i = 0; i < nums.size(); i++)
		{
			int newIndex = (index + k) % nums.size();
			int temp = nums[newIndex];
			nums[newIndex] = preValue;
			index = newIndex;
			preValue = temp;
			count += k;
			if(count % nums.size() == 0)
			{
				index++;
				preValue = nums[index];
				count = 0;
			}
		}
    }
};