LeetCode (262):Nim Game

最新推荐文章于 2023-10-30 12:34:02 发布

转载最新推荐文章于 2023-10-30 12:34:02 发布 · 144 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

原文链接：http://www.cnblogs.com/rever/p/4887958.html

标签

#数据结构与算法 #java

本文探讨了Nim游戏中的胜负策略，通过分析不同石头数量下的游戏状态，得出了一种简单的判断胜负的方法。当石头总数为4的倍数时，先手玩家将面临必败的局面；反之，则有获胜的机会。文章提供了Java实现的示例代码。

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?

思路：

当heap中有1、2、3个stones时一定获胜，当有4个stones时一定会输。那么当有5个stones的时候，我们可以先拿出来一个stones，此时相当于我们面对4个stones时的情形。

依次可以类推出，当heap中恰好有4N（N=1,2,3......）个stones时，我方一定会输。

java代码:

public class Solution {
    public boolean canWinNim(int n) {
        if(n%4==0) return false;
        else return true;
    }
}

转载于:https://www.cnblogs.com/rever/p/4887958.html