[leetcode]292. Nim Game

[leetcode]292. Nim Game

---

Analysis

周五啦，端午小长假要开始啦~—— [嘻嘻~]

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.
找规律的题，列举比较少的石头数试一下，会发现只要石头数是4的倍数就会输。

Implement

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