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.
void rotate(int* nums, int numsSize, int k)
{
int *TempArray;
TempArray=(int *)malloc(numsSize*sizeof(int)); for(int i=;i<numsSize;i++)
{
if((i+k+)<=numsSize)
{
TempArray[i+k]=nums[i];
}
else
{
TempArray[(i+k)%numsSize]=nums[i];
}
} for(int i=;i<numsSize;i++)
{
nums[i]=TempArray[i];
}
}