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.

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.

 

分析：

拿到这道题我懵比了，怎么做？？想了半天怎么弄，然后还是没有思路，然后就去搜解决方法，结果，受打击了，一行代码搞定的问题，号称是LeetCode最简单的

一道题目。不说了，上代码吧，TAT

function canWin(n) {
  return n%4 !=0;  
}

很简单，只要剩下4个石头，不论怎么取，都会输，相对应的如果是8，你不论怎么取石头，对方总有办法保持当前的石头为4的倍数，于是你就输了。

转载于:https://www.cnblogs.com/gogolee/p/6656810.html