g1001_1100.s1025_divisor_game.Solution Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java21 Show documentation

Java-based LeetCode algorithm problem solutions, regularly updated

There is a newer version: 1.41

package g1001_1100.s1025_divisor_game;

// #Easy #Dynamic_Programming #Math #Game_Theory #Brainteaser
// #2022_02_26_Time_0_ms_(100.00%)_Space_40.7_MB_(27.10%)

/**
 * 1025 - Divisor Game\.
 *
 * Easy
 *
 * 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:** n = 2
 *
 * **Output:** true
 *
 * **Explanation:** Alice chooses 1, and Bob has no more moves.
 *
 * **Example 2:**
 *
 * **Input:** n = 3
 *
 * **Output:** false
 *
 * **Explanation:** Alice chooses 1, Bob chooses 1, and Alice has no more moves.
 *
 * **Constraints:**
 *
 * *   `1 <= n <= 1000`
**/
public class Solution {
    public boolean divisorGame(int n) {
        return n % 2 == 0;
    }
}