lc292. Nim Game

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. n回合 轮到他石子数字为4，我赢
2. n-1回合，轮到我石子数为5-7，我能给他留4，我赢
3. n-2回合，轮到他石子数为8，我赢 石子数目不为4的倍数，我赢，否则，输

代码:python3

class Solution:
    def canWinNim(self, n: int) -> bool:
        if n%4 ==0:
            return False
        else:
            return True
复制代码

转载于:https://juejin.im/post/5cee2db1f265da1bce3db316