add 1025

fishercoder1534 · fishercoder1534 · commit 8a4b97dc1c9b · 2021-07-05T16:46:38.000-07:00
diff --git a/README.md b/README.md
@@ -384,7 +384,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|
+|1025|[Divisor Game](https://leetcode.com/problems/divisor-game/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1025.java) | |Easy|Math, DP, Brainteaser, Game Theory|
 |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
@@ -2,9 +2,14 @@
 
 public class _1025 {
     public static class Solution1 {
+        /**
+         * After writing out a few examples, beginning from n = 1, up to n = 5, the logic flows out naturally:
+         * 1. when N deduced to 1, whoever plays now loses because no integers exist between 0 and 1;
+         * 2. when N deduced to 2, whoever plays now wins because he/she will pick one and the next player is left with nothing to play;
+         * 3. all numbers N will eventually be deduced to either 1 or 2 depending on whether its odd or even.
+         */
         public boolean divisorGame(int N) {
-            //TODO: implement it
-            return false;
+            return N % 2 == 0;
         }
     }
 }

Original file line number	Diff line number	Diff line change
`@@ -2,9 +2,14 @@`
`2`	`2`
`3`	`3`	`public class _1025 {`
`4`	`4`	`public static class Solution1 {`
	`5`	`+ /**`
	`6`	`+ * After writing out a few examples, beginning from n = 1, up to n = 5, the logic flows out naturally:`
	`7`	`+ * 1. when N deduced to 1, whoever plays now loses because no integers exist between 0 and 1;`
	`8`	`+ * 2. when N deduced to 2, whoever plays now wins because he/she will pick one and the next player is left with nothing to play;`
	`9`	`+ * 3. all numbers N will eventually be deduced to either 1 or 2 depending on whether its odd or even.`
	`10`	`+ */`
`5`	`11`	`public boolean divisorGame(int N) {`
`6`		`- //TODO: implement it`
`7`		`- return false;`
	`12`	`+ return N % 2 == 0;`
`8`	`13`	`}`
`9`	`14`	`}`
`10`	`15`	`}`