一. 题目
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.
二. 思路
题目为Nim Game,两人轮流从一堆石子中取1~3个,取最后的1~3个的人为胜,假设你为第一个取石子的人,输入为石子数,判断你是否有可能赢。
题目中同时指出,当石子数为4时,你不会赢,因为不论你在第一轮取几个,剩下的都可以被对方一次取走。
而其实4正好是一个零界点,当石子个数为4的倍数时,都会面临以上的情况。而当石子数不是4的倍数时,意味着石子数为4n+(1~3),因为你是首先拿的人,所以你总有机会取得最后的1~3个石子,在这种情况下,可以赢。
所以,条件为石子数不能为4的倍数。由于leetcode没考虑负数的问题,所以在此也不考虑了。
三. AC代码
public boolean canWinNim(int n) {
if(n%4==0)
return false;
else
return true;
}