LeetCode: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.
Hint:
If there are 5 stones in the heap, could you figure out a way to remove the stones such that you will always be the winner?
Credits: Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.
考え方:
winができる場合を書き出して、法則を見つけて、意外にもすべて4の倍数で、だからコードはとても簡単です.
コード:

<pre name="code" class="cpp">class Solution {
public:
    bool canWinNim(int n) {
    if(n > 0 && n < 4)
        return true;
    if(n % 4 == 0)
        return false;
    else 
        return true;
    }
};