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.
难度系数:
容易
实现
void rotate(int nums[], int n, int k) {
int temp;
for (int step = 0; step < k; step++) {
temp = nums[n-1];
for (int i = n-1; i > 0; --i)
{
nums[i] = nums[i-1];
}
nums[0] = temp;
}
}
时间: 2024-10-11 02:08:54