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]
Related problem: Reverse Words in a String II
Credits:

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

代码：

class Solution {
public:
    void rotate(int nums[], int n, int k) {
		if (n <= 1) {
			return;
		}

		k = k % n;
		if (k < 0) {
			k = n + k;
		}
		
		int *data = new int[n];
		int singleSize = sizeof(int);
		memcpy(data, nums + n - k, k * singleSize);
		memcpy(data + k, nums, (n - k) * singleSize);
		memcpy(nums, data, n * singleSize);
		delete [] data;
    }
};