292. Nim Game

最新推荐文章于 2023-10-10 22:04:07 发布

原创最新推荐文章于 2023-10-10 22:04:07 发布 · 237 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

31 篇文章

订阅专栏

本文介绍了一种数学方法来判断Nim游戏的胜负。当玩家面对堆中石头数量为4的倍数时将输掉游戏。文章提供了一个简洁的Python实现，通过取模运算快速判断玩家是否能赢得游戏。

292. Nim Game

Leetcode link for this question

Discription:

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.

Analyze:

It is a math problem. When the person facing 4 stones in the heap(more generally, the number of stones is multiple of 4), he will lose the game.

Code 1:

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

Submission Result:

Status: Accepted
Runtime: 68 ms
Ranking: beats 67.24%