292. Nim Game

标签：boolean   move   OWIN   whether   nim   div   simple   game   ever   

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.

Example:

Input: 4
Output: false 
Explanation: 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.

class Solution {
    public boolean canWinNim(int n) {
        return (n % 4 != 0);
    }
}

不愧是simple

class Solution {
    public boolean canWinNim(int n) {
        boolean[] dp = new boolean[n+1];
        dp[1] = true;
        dp[2] = true;
        dp[3] = true;
        for(int i = 4; i <= n; i++){
            dp[i] = !dp[i - 1] || !dp[i - 2] || !dp[i - 3];
        }
        return dp[n];
    }
}

还是dp好点

292. Nim Game

标签：boolean   move   OWIN   whether   nim   div   simple   game   ever   

原文地址：https://www.cnblogs.com/wentiliangkaihua/p/11804137.html