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.

Hint:

1. 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?

my answer:

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

本题注意事项：

1个石子，自己胜； 
2个石子，自己胜； 
3个石子，自己胜； 
4个石子，朋友面对的是我的第1，2，3情况，朋友必胜； 
5个石子，我拿走1个让朋友面对第4种情况，朋友必败； 
6个石子，我拿走2个让哦也面对第4种情况，朋友必败； 
……

容易看出来，只有当出现了4的倍数，我无可奈何，其余情况我都可以获胜。 （石子数量为4的倍数）