原题:
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.
题意:
你与你的朋友正在玩一个游戏:现在有一堆石头在桌子上,每一次你们当中一个轮流拿走1-3个石头,谁最后拿走石头的为赢家,你将第一个拿石头。
你们两个都有足够聪明并且都有最优的策略,写一个方法去决定你是否能够赢得游戏。
例如,现在有4个石头,无论你拿走1,2或者3个是有,最后拿走石头的都是你的朋友。
思路:
一句话,就是找规律,类推。
首先,假设石头的个数为n。当n=1或n=2或n=3时,你都能赢得比赛;当n=4时你的朋友赢得比赛;当n=5时,第一次拿1,无论你的朋友拿多少个,你都将最后拿光石头;(以此类推,注意将问题转化为小规模)…当n=8时,你的朋友赢得比赛…
由上可以发现规律:每当是4的倍数时,你总无法赢得比赛,其他情况都可以,所以问题就变得很简单了。
代码:
public class Solution {
public boolean canWinNim(int n) {
if(n % 4 == 0){
return false;
}else{
return true;
}
}
}