LeetCode OJ：Nim Game（Nim游戏）

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.

这个规定了自己先抽，那么很简单了 先看一下规律：

1：win

2: win

3: win

4: 无论如何都无法win

5：拿1，让对方面对4

6：拿2，让对方面对4

7：拿3，让对方面对4

8：没有办法

.....

可见，当石头数量是4的倍数的时候，先手是无可奈何的，所以代码就很简单了，如下：

 class Solution {
 public:
     bool canWinNim(int n) {
         return n%;
     }
 };