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

分析：

当最后剩下4个时，必输；剩下5个，选取1个，赢；剩下6个，选2个，赢；剩下7个，选3个，赢；剩下8个时，无论选取多少个，对方都可以通过选取使你剩下4个，输。可以看出，每次剩余4的倍数，输，其余的可以赢。

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