_1752.java

packagecom.fishercoder.solutions.secondthousand;

importjava.util.Arrays;

publicclass_1752 {
publicstaticclassSolution1 {
publicbooleancheck(int[] nums) {
int[] copy = Arrays.copyOf(nums, nums.length);
Arrays.sort(copy);
for (inti = 1; i <= nums.length; i++) {
int[] rotated = rotate(nums, i);
if (Arrays.equals(rotated, copy)) {
returntrue;
 }
 }
returnfalse;
 }

privateint[] rotate(int[] nums, intstart) {
int[] rotated = newint[nums.length];
intj = 0;
for (inti = start; i < nums.length; i++, j++) {
rotated[j] = nums[i];
 }
for (inti = 0; i < start; i++) {
rotated[j++] = nums[i];
 }
returnrotated;
 }
 }
}