add skeleton for 1025

fishercoder1534 · fishercoder1534 · commit e754d6dc4b64 · 2020-02-03T07:10:22.000-08:00
diff --git a/README.md b/README.md
@@ -86,6 +86,7 @@ _If you like this project, please leave me a star._ &#9733;
 |1033|[Moving Stones Until Consecutive](https://leetcode.com/problems/moving-stones-until-consecutive/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1033.java) | |Easy|Math|
 |1030|[Matrix Cells in Distance Order](https://leetcode.com/problems/matrix-cells-in-distance-order/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1030.java) | |Easy|
 |1029|[Two City Scheduling](https://leetcode.com/problems/two-city-scheduling/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1029.java) | |Easy|
+|1025|[Divisor Game](https://leetcode.com/problems/divisor-game/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1025.java) | |Easy|
 |1022|[Sum of Root To Leaf Binary Numbers](https://leetcode.com/problems/sum-of-root-to-leaf-binary-numbers/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1022.java) | |Easy|
 |1021|[Remove Outermost Parentheses](https://leetcode.com/problems/remove-outermost-parentheses/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1021.java) | |Easy|
 |1020|[Number of Enclaves](https://leetcode.com/problems/number-of-enclaves/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1020.java) | |Medium|Graph, DFS, BFS, recursion|
diff --git a/src/main/java/com/fishercoder/solutions/_1025.java b/src/main/java/com/fishercoder/solutions/_1025.java
@@ -0,0 +1,33 @@
+package com.fishercoder.solutions;
+
+/**
+ * 1025. Divisor Game
+ *
+ * Alice and Bob take turns playing a game, with Alice starting first.
+ * Initially, there is a number N on the chalkboard.  On each player's turn, that player makes a move consisting of:
+ * Choosing any x with 0 < x < N and N % x == 0.
+ * Replacing the number N on the chalkboard with N - x.
+ * Also, if a player cannot make a move, they lose the game.
+ * Return True if and only if Alice wins the game, assuming both players play optimally.
+ *
+ * Example 1:
+ * Input: 2
+ * Output: true
+ * Explanation: Alice chooses 1, and Bob has no more moves.
+ *
+ * Example 2:
+ * Input: 3
+ * Output: false
+ * Explanation: Alice chooses 1, Bob chooses 1, and Alice has no more moves.
+ *
+ * Note:
+ * 1 <= N <= 1000
+ * */
+public class _1025 {
+    public static class Solution1 {
+        public boolean divisorGame(int N) {
+            //TODO: implement it
+            return false;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1025Test.java b/src/test/java/com/fishercoder/_1025Test.java
@@ -0,0 +1,23 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1025;
+import org.junit.Before;
+import org.junit.Ignore;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+@Ignore
+public class _1025Test {
+    private static _1025.Solution1 solution1;
+
+    @Before
+    public void setup() {
+        solution1 = new _1025.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(true, solution1.divisorGame(2));
+    }
+}
