(leetcode)C++回転配列を実現

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