add skeleton for 1175

fishercoder1534 · fishercoder1534 · commit 017b6e4bc779 · 2020-02-02T15:28:59.000-08:00
diff --git a/README.md b/README.md
@@ -51,6 +51,7 @@ _If you like this project, please leave me a star._ &#9733;
 |1185|[Day of the Week](https://leetcode.com/problems/day-of-the-week/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1185.java) | |Easy||
 |1184|[Distance Between Bus Stops](https://leetcode.com/problems/distance-between-bus-stops/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1184.java) | [:tv:](https://www.youtube.com/watch?v=RFq7yA5iyhI)|Easy||
 |1180|[Count Substrings with Only One Distinct Letter](https://leetcode.com/problems/count-substrings-with-only-one-distinct-letter/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1180.java) | |Easy|Math, String|
+|1175|[Prime Arrangements](https://leetcode.com/problems/prime-arrangements/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1175.java) | |Easy||
 |1165|[Single-Row Keyboard](https://leetcode.com/problems/single-row-keyboard/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1165.java) | |Easy||
 |1160|[Find Words That Can Be Formed by Characters](https://leetcode.com/problems/find-words-that-can-be-formed-by-characters/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1160.java)| |Easy||
 |1154|[Day of the Year](https://leetcode.com/problems/day-of-the-year/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1154.java) | |Easy||
diff --git a/src/main/java/com/fishercoder/solutions/_1175.java b/src/main/java/com/fishercoder/solutions/_1175.java
@@ -0,0 +1,30 @@
+package com.fishercoder.solutions;
+
+/**
+ * 1175. Prime Arrangements
+ *
+ * Return the number of permutations of 1 to n so that prime numbers are at prime indices (1-indexed.)
+ * (Recall that an integer is prime if and only if it is greater than 1,
+ * and cannot be written as a product of two positive integers both smaller than it.)
+ * Since the answer may be large, return the answer modulo 10^9 + 7.
+ *
+ * Example 1:
+ * Input: n = 5
+ * Output: 12
+ * Explanation: For example [1,2,5,4,3] is a valid permutation, but [5,2,3,4,1] is not because the prime number 5 is at index 1.
+ *
+ * Example 2:
+ * Input: n = 100
+ * Output: 682289015
+ *
+ * Constraints:
+ * 1 <= n <= 100
+ * */
+public class _1175 {
+    public static class Solution1 {
+        public int numPrimeArrangements(int n) {
+            //TODO: implement it
+            return -1;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1175Test.java b/src/test/java/com/fishercoder/_1175Test.java
@@ -0,0 +1,24 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1175;
+import org.junit.BeforeClass;
+import org.junit.Ignore;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+@Ignore
+public class _1175Test {
+    private static _1175.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1175.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(12, solution1.numPrimeArrangements(5));
+    }
+
+}
