1025. Divisor Game

最新推荐文章于 2022-01-01 22:06:49 发布

tbabm_

最新推荐文章于 2022-01-01 22:06:49 发布

阅读量145

点赞数

分类专栏：算法文章标签： stl

本文链接：https://blog.csdn.net/hdjiguangxi/article/details/89367097

版权

47 篇文章 0 订阅

订阅专栏

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:

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.

Note:

题意：博弈问题，Alice先手。共N个石子，每个人可取x个石子，这里x要满足:(1)0<x<N (2)N%x=0

思路：博弈问题关键在于根据题意，推敲规律。

N=2时，Alice取1个，Bob不能再取，Alice胜。

N=3时，Alice只能取1个，Bob取1个，Alice输。

N=4时，Alice取1个，Bob面对3个石头的情况，由上知Bob必输，即Alice必胜。

N=5时，Alice只能取1个，Bob面对4个石头的情况，由上知Alice必输。

......

可知，当N为偶数时，Alice必胜，否则Alice必输。

class Solution {
public:
    bool divisorGame(int N) {
        if(N%2==0)
            return true;
        else 
            return false;
    }
};

关注