leetcode刷题，总结，记录， 备忘 292

leetcode292 Nim Game

You are playing the following Nim Game with your friend: There is a heap of stones on the table, each time one of you take turns to remove 1 to 3 stones. The one who removes the last stone will be the winner. You will take the first turn to remove the stones.

Both of you are very clever and have optimal strategies for the game. Write a function to determine whether you can win the game given the number of stones in the heap.

For example, if there are 4 stones in the heap, then you will never win the game: no matter 1, 2, or 3 stones you remove, the last stone will always be removed by your friend.

一个数学的问题，自己去特地百度了一下，了解了下。

求解方法，就是石头总数不能是4的倍数。就是说在自己拿完石头之后，可以让石头处于4的倍数的状态，因为每次只能拿1-3个石头，如果石头数不是4 个倍数，自己先拿，可以让每次拿完后石头数量为4的倍数，最终的结果就是石头剩余数为4，这时对手无论拿1个，2个，还是3个，都是输，所以这个胜负的关键就是自己拿的时候石头总数是否为4个倍数，不是就能赢。就像题目中描述的那样，石头总数为4的时候，自己先拿必输，由此推断。代码就很简单了。

class Solution {
public:
    bool canWinNim(int n) {
        return n % 4 != 0;
    }
};