[leetcode 292]Nim Game

Question：

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.

Code:

比较简单的一题，自己先拿，最多3个，那么对手只要保证拿的个数和你的个数是4，你就稳输

**Java **

public class Solution {
    public boolean canWinNim(int n) {
        return n%4!=0?true:false;
    }
}

python

class Solution(object):
    def canWinNim(self, num):
        return num % 4 > 0

JS

/**
 * @param {number} n
 * @return {boolean}
 */

var canWinNim = function(n) {

    return n%4 !==0 ;

};