【leetcode】旋转数组

void rotate(int* nums, int numsSize, int k){
    
    k %= numsSize;
    if (numsSize !=1 && k!=0)
    {
        int index = numsSize - k;
        int* p = (int*)malloc(numsSize*sizeof(int));
        for (int i = 0; i< numsSize; i++)
        {
            p[i] = nums[index];    
            index = (index + 1) % numsSize;
        }
        for (int j = 0; j< numsSize; j++)
        {
            nums[j] = p[j];
        }
        free(p);
    }
}