java “数石子”游戏算法

最新推荐文章于 2024-02-18 20:52:38 发布

原创最新推荐文章于 2024-02-18 20:52:38 发布 · 826 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#java #算法 #游戏

leetcode 专栏收录该内容

42 篇文章

订阅专栏

本文介绍了一种用于判断Nim游戏胜负的算法实现。在该游戏中，玩家轮流从一堆石头中取走1到3颗，拿走最后一颗的人获胜。通过简单的数学逻辑，文章中的算法能够快速判断在给定石头数量的情况下，先手玩家是否能赢得游戏。

题目：

 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.

下面是我的算法实现：

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