Leetcode: Nim Game

最新推荐文章于 2021-02-24 15:41:56 发布

原创最新推荐文章于 2021-02-24 15:41:56 发布 · 369 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

216 篇文章

订阅专栏

本文详细解析了Nim游戏的获胜策略，并提供了一个Python函数来判断玩家是否能赢得游戏，给定游戏堆中石子的数量。通过理解和应用最优策略，玩家可以确保在Nim游戏中获胜。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

Hint:

If there are 5 stones in the heap, could you figure out a way to remove the stones such that you will always be the winner?
Credits:
Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.

Hide Similar Problems (M) Flip Game II

My Solution

class Solution(object):
    def canWinNim(self, n):
        """
        :type n: int
        :rtype: bool
        """

        return True if n%4!=0 else False