LeetCode-292. Nim Game (Java)

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.

-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

这道题我画了一早上没做出来，最后百度看到答案，看到答案我有点受惊，就这么简单？先上代码：

public class Solution {    public boolean canWinNim(int n) {         int val = n%4;        if(val >= 1 && val <= 3)            return true;        return false;    }}

其实这道题我不是很懂，举个例子，按照上面这个代码，12显示我会输，按照代码的意思，每次都取3时我会输，但是按照题意说each time one of you take turns to remove1 to 3stones. 如果我没翻译错的话是每次可以取1或2或3个石头吧，那12的话这个顺序我不会输啊：1122213，红色代表我取的石头个数。

所以不是很懂这个题~~~