void rotate(int* nums, int numsSize, int k) {
int i,j,b;
for (i = 0; i < k; i++)
{ b=nums[numsSize-1];
for (j = numsSize-2; j >= 0; j--)
{
nums[j+1]=nums[j];
}
nums[0]=b;
}
}
LeetCode 189.旋转数组
猜你喜欢
转载自blog.csdn.net/ychhh/article/details/80375881
今日推荐
周排行