Leetcode Everyday: 292. Nim Game

原创于 2016-05-11 22:48:28 发布 · 224 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

69 篇文章

订阅专栏

本文介绍了一种Nim游戏的胜负判断算法。在该游戏中，两名玩家轮流从一堆石头中取走1到3块，取走最后一块石头的人获胜。文章提供了一个简洁的解决方案，通过简单的数学运算来判断先手玩家是否能赢得比赛。

https://leetcode.com/problems/nim-game/

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 boolean canWinNim(int n) {
        int result = (n-1)%4;
        if(result == 3) return false;
        return true;
    }
}

boolean [n] = !(boolean [n-1] && boolean [n-2] && boolean [n-3]);

T T T F T T T F T T T F .......