add 1752

fishercoder1534 · fishercoder1534 · commit 094d300947db · 2021-02-07T09:06:48.000-08:00
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1752|[Check if Array Is Sorted and Rotated](https://leetcode.com/problems/check-if-array-is-sorted-and-rotated/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1752.java) ||Easy|Array|
 |1750|[Minimum Length of String After Deleting Similar Ends](https://leetcode.com/problems/minimum-length-of-string-after-deleting-similar-ends/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1750.java) ||Medium|Two Pointers|
 |1749|[Maximum Absolute Sum of Any Subarray](https://leetcode.com/problems/maximum-absolute-sum-of-any-subarray/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1749.java) ||Medium|Greedy|
 |1748|[Sum of Unique Elements](https://leetcode.com/problems/sum-of-unique-elements/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1748.java) ||Easy|Array, HashTable|
diff --git a/src/main/java/com/fishercoder/solutions/_1752.java b/src/main/java/com/fishercoder/solutions/_1752.java
@@ -0,0 +1,31 @@
+package com.fishercoder.solutions;
+
+import java.util.Arrays;
+
+public class _1752 {
+    public static class Solution1 {
+        public boolean check(int[] nums) {
+            int[] copy = Arrays.copyOf(nums, nums.length);
+            Arrays.sort(copy);
+            for (int i = 1; i <= nums.length; i++) {
+                int[] rotated = rotate(nums, i);
+                if (Arrays.equals(rotated, copy)) {
+                    return true;
+                }
+            }
+            return false;
+        }
+
+        private int[] rotate(int[] nums, int start) {
+            int[] rotated = new int[nums.length];
+            int j = 0;
+            for (int i = start; i < nums.length; i++, j++) {
+                rotated[j] = nums[i];
+            }
+            for (int i = 0; i < start; i++) {
+                rotated[j++] = nums[i];
+            }
+            return rotated;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1752Test.java b/src/test/java/com/fishercoder/_1752Test.java
@@ -0,0 +1,42 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1752;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1752Test {
+    private static _1752.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1752.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(true, solution1.check(new int[]{3, 4, 5, 1, 2}));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(false, solution1.check(new int[]{2, 1, 3, 4}));
+    }
+
+    @Test
+    public void test3() {
+        assertEquals(true, solution1.check(new int[]{1, 2, 3}));
+    }
+
+    @Test
+    public void test4() {
+        assertEquals(true, solution1.check(new int[]{1, 1, 1}));
+    }
+
+    @Test
+    public void test5() {
+        assertEquals(true, solution1.check(new int[]{2, 1}));
+    }
+
+}
