算法系列（12）LeetCode292 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.

思路：这道题乍得一看很复杂，但其实是最简单的一道，题目最后给出了提示，有四个石头的时候，怎么都不会赢。那么如果石头总数是4的倍数，只要对手保证每次都凑够4的话，对手就一定会赢。

/** * @param {number} n * @return {boolean} */var canWinNim = function(n) {    var can = n%4;    if(can == 0){        return false;    }    else{        return true;    }};