leetcode-problems/nim-game.js at master · Edsdover/leetcode-problems · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
//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.

console.log(canWinNim(4), 'False')
console.log(canWinNim(1), 'True')
console.log(canWinNim(6), 'True')
console.log(canWinNim(10), 'True')
console.log(canWinNim(12), 'False')

function canWinNim(n) {
    if (n % 4 === 0) {
        return false;
    }
    return true;
};