【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.

大致意思就是，你和你朋友一起玩游戏，取石头，桌上有一堆，每次只能拿1-3个，最后拿完的话就赢了，返回true，否则返回false，但是你要记住你朋友和你一样聪明，也就是说会采用和你一样的最佳算法。

刚开始的时候真的是没思路的，经过短时间的总结也没发现啥，就知道4个肯定输，5,6,7个都不一定。当时想：我屮艸芔茻，这是啥？然后就羞耻的跑去搜索引擎了。这是leetcode最简单的题...真的吗？然后发现别人说只要能被4整除就输了，后来再看，还真是，所以。。。大家一定要有耐心，也许是我太笨了。

好，以下是解题代码：

/**
 * @param {number} n
 * @return {boolean}
 */
var canWinNim = function(n) {
    return n%4!=0;
};