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.
你正和你的朋友玩Nim Game:桌上有一堆石头，你每次只能取走1~3块石头，而取走最后一块石头的人将获得胜利。在这场游戏中你先行。

你和你的朋友都非常聪明，并且都会选择最优策略来行动。写一个函数来判断在已知石头数目的情况下你能否取得胜利。

例如，如果还剩4块石头时，无论你取走1、2还是3块石头，最后一块石头都将被你朋友取走（从而获得胜利）。

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

翻译之后补上，就当是练习英语了。