lc1025. Divisor Game
- Divisor Game Easy
151python
442ci
Favoriteit
Share Alice and Bob take turns playing a game, with Alice starting first.io
Initially, there is a number N on the chalkboard. On each player's turn, that player makes a move consisting of:class
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.im
Return True if and only if Alice wins the game, assuming both players play optimally.di
Example 1:vi
Input: 2 Output: true Explanation: Alice chooses 1, and Bob has no more moves. Example 2:make
Input: 3 Output: false Explanation: Alice chooses 1, Bob chooses 1, and Alice has no more moves.co
思路：倒数第二步，爱丽丝必须为2，才能赢， 是奇数的状况下，计算 N - x必为偶数，因此爱丽丝必须保证本身这边为偶数，
代码：python3 class Solution: def divisorGame(self, N: int) -> bool: return N%2==0
- 1. 【leetcode】1025. Divisor Game
- 2. LeetCode.1025-除数游戏(Divisor Game)
- 3. [Swift]LeetCode1025. 除数博弈 | Divisor Game
- 4. [leetcode]1025.除数博弈（Divisor Game）C++代码实现
- 5. Java/1025. Divisor Game 除数博弈（为什么要这样解）
- 6. Leetcode之动态规划（DP）专题-1025. 除数博弈（Divisor Game）
- 7. Weakened Common Divisor
- 8. Codeforces1334E - Divisor Paths
- 9. Game（思惟）
- 10. HDU6312: Game 题解
- 更多相关文章...
- • ionic icon(图标) - ionic 教程
-
每一个你不满意的现在，都有一个你没有努力的曾经。
- 1. 【leetcode】1025. Divisor Game
- 2. LeetCode.1025-除数游戏(Divisor Game)
- 3. [Swift]LeetCode1025. 除数博弈 | Divisor Game
- 4. [leetcode]1025.除数博弈（Divisor Game）C++代码实现
- 5. Java/1025. Divisor Game 除数博弈（为什么要这样解）
- 6. Leetcode之动态规划（DP）专题-1025. 除数博弈（Divisor Game）
- 7. Weakened Common Divisor
- 8. Codeforces1334E - Divisor Paths
- 9. Game（思惟）
- 10. HDU6312: Game 题解