LeetCode Algorithms #292 <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.

思路：
先考虑AB都只拿一次的情况，即游戏只进行一轮，列出所有可能的石头数量会发现，后拿者如果想获得胜利，石头总数必须为4。

归纳看整个拿石头的过程，后拿者想要确保游戏胜利，必须保证下个拿取周期，就是对方拿石子的时候，石子是4的倍数。

因此只有石头一开始就是4的倍数时，后拿石头的人才可以获得胜利。除此之外，先拿石头的人总是能获得胜利。

解：

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