leetcode 292. Nim Game（C语言）

  第七天打卡。
  不得不吐槽，这道题想起来有点复杂，写起来简直怀疑为什么leetcode会收录这样的题目。
贴原题：

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.

Credits: Special thanks to @jianchao.li.fighter for adding this
problem and creating all test cases.

贴C代码：

bool canWinNim(int n) {    if(n%4==0)    {        return false;    }    else    {        return true;    }}

怀疑人生，我要再去做一题压压惊……