leetCode刷题记录43_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.
Example:
    Input: 4
    Output: false 
    Explanation: 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个，2个或3个，因此如果石头总数能被4整除则一定不能赢，如果不能被4整除那么第一把取除4的余数就可以了
/*****************************************************我的解答*************************************************
/**
 * @param {number} n
 * @return {boolean}
 */
var canWinNim = function(n) {
    return !(n % 4 == 0);
};