LeetCode rotate array

Given an array, rotate the elements of the array to the right by k positions, where kis a non-negative number.

Input: nums = [1,2,3,4,5,6,7], k = 3
Output: [5,6,7,1,2,3,4]
Explanation:
Rotate 1 step to the right: [7,1,2,3,4,5,6]
Rotate 2 steps to the right: [6,7,1,2,3,4,5]
Rotate 3 steps to the right: [5,6,7,1,2,3,4]

Input: nums = [-1,-100,3,99], k = 2
Output: [3,99,-1,-100]
Explanation:
Rotate right by 1Step: [99,-1,-100,3]
Rotate right 2 steps: [3,99,-1,-100]

How to solve the problem:

Create a new array, number[(i+k)%numsSize]=nums[i]

Assign to a new array

Code display:

void rotate(int* nums, int numsSize, int k){int number[numsSize];for(int i=0;i