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块石头:赢;2块石头:赢;3块石头:赢;4块石头:输
5块石头:先拿一块,赢;6块石头:先拿两块,赢;7块石头:先拿3块,赢;8块石头:输
总结:当为4的倍数时,无法获胜。
代码可得:
public class Solution {
public boolean canWinNim(int n) {
return n%4!=0;
}
}
很简单的一个题目!