A way to solve shift numbers in java

ShiftNums.java

public static int[] shiftNums(int[] nums, int shiftCount) {
    int[] numsClone = nums.clone();

    while (shiftCount > 0) {
        int itemToBeShifted = nums[nums.length - 1];

        for (int i = 0; i < nums.length - 1; i++) {
            nums[i + 1] = numsClone[i];
        }

        nums[0] = itemToBeShifted;
        numsClone = nums.clone();

        shiftCount--;
    }

    return nums;
}