LeetCode 292. Nim Game

oo笨小孩oo

于 2016-05-14 23:12:40 发布

阅读量505

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode 文章标签： leetcode java 算法

本文链接：https://blog.youkuaiyun.com/programmer_wei/article/details/51412749

LeetCode 专栏收录该内容

13 篇文章

订阅专栏

本文介绍了一种Nim游戏的胜负判断策略。该游戏中玩家轮流从一堆石头中取走1到3块，取走最后一块的玩家获胜。通过分析得出，当初始石头数量能被4整除时，先手无法取胜；否则，先手必胜。

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

题目

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 Solution292 {

    public static void main(String[] args) {
        Solution292 solution292 = new Solution292();

        int n = 4;

        solution292.canWinNim(n);
    }

    /**
     *纸上写出来找规律
     */
    public boolean canWinNim(int n) {
        if(n%4==0)
            return false;
        else
            return true;
    }
}