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.
Nim Game游戏：有一堆石头，你和朋友轮流石碓里取一定数量的石头，每次拿石头的数量是1/2/3,即不可以不拿，也不能超过3个。能拿到石碓最后一块石头的取胜，游戏从你开始，即你是第一个拿石头的人。请给出一个函数来判断是否你能赢得游戏。
解题思路：设n为石碓内石块总数，两个人A、B，则n={1,2,3}时，A胜；n=4时，B胜；n={5,6,7}={1+4，2+4，3+4}，即当A第一次拿走1、2、3时，转化为n=4的情形，此时A胜；n=8=4+4=1+3+4/2+2+4/3+1+4时，此时B胜……一次类推，n%4!=0时，A可取胜。
代码如下：
<script type="text/javascript">
/**
* @param {number} n
* @return {boolean}
*/
var canWinNim = function(n) {
var win;
if(n % 4 != 0){
win = true;
} else {
win = false;
}
return win;
};
</script>