lc1025. Divisor Game

1025. Divisor Game Easy

151

442

Favorite

Share 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.

思路：倒數第二步，愛麗絲必須爲2，才能贏， 是奇數的狀況下，計算 N - x必爲偶數，因此愛麗絲必須保證本身這邊爲偶數，

代碼：python3 class Solution: def divisorGame(self, N: int) -> bool: return N%2==0