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) { //dp: 内存溢出..
if (n == 1 || n == 2 || n == 3)
return true;
boolean[] dp = new boolean[n + 1];
dp[0] = dp[1] = dp[2] = dp[3] = true;
for (int i = 4; i < n + 1; i++) {
if (dp[i - 1] && dp[i - 2] && dp[i - 3])
dp[i] = false;
else
dp[i] = true;
}
return dp[n];
}
}
public boolean canWinNim(int n) {
return n % 4 != 0; //早就想到了，没这样写，，这也太无聊了
}
public class Solution {
public boolean canWinNim(int n) { //递归,time limit
if (n == 1 || n == 2 || n == 3)
return true;
if (canWinNim(n - 1) && canWinNim(n - 2) && canWinNim(n - 3))
return false;
return true;
}
}
原文：http://www.cnblogs.com/kydnn/p/5380186.html