Package g1001_1100.s1025_divisor_game
Class Solution
java.lang.Object
g1001_1100.s1025_divisor_game.Solution
1025 - Divisor Game.<p>Easy</p>
<p>Alice and Bob take turns playing a game, with Alice starting first.</p>
<p>Initially, there is a number <code>n</code> on the chalkboard. On each player’s turn, that player makes a move consisting of:</p>
<ul>
<li>Choosing any <code>x</code> with <code>0 < x < n</code> and <code>n % x == 0</code>.</li>
<li>Replacing the number <code>n</code> on the chalkboard with <code>n - x</code>.</li>
</ul>
<p>Also, if a player cannot make a move, they lose the game.</p>
<p>Return <code>true</code> <em>if and only if Alice wins the game, assuming both players play optimally</em>.</p>
<p><strong>Example 1:</strong></p>
<p><strong>Input:</strong> n = 2</p>
<p><strong>Output:</strong> true</p>
<p><strong>Explanation:</strong> Alice chooses 1, and Bob has no more moves.</p>
<p><strong>Example 2:</strong></p>
<p><strong>Input:</strong> n = 3</p>
<p><strong>Output:</strong> false</p>
<p><strong>Explanation:</strong> Alice chooses 1, Bob chooses 1, and Alice has no more moves.</p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>1 <= n <= 1000</code></li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
divisorGame
public boolean divisorGame(int n)
-