void rotate(int * nums, int numsSize, int k)
{
if(nums==NULL||numsSize<=0) return ;
int nk = k%numsSize;
int middle = numsSize - nk;
swap(nums,0,middle-1);
swap(nums,middle,numsSize-1);
swap(nums,0,numsSize-1);
}
void swap(int * nums,int a, int b )
{
while(a<b)
{
int temp= arr[a];
arr[a] = arr[b];
arr[b] = temp;
a++;
b--;
}
}
(leetcode)C++实现旋转数组
最新推荐文章于 2025-07-20 13:26:43 发布