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.
题目中最后举4的例子很重要。
n: 1 2 3 4 5 6 7 8 9 10 11 12 13 。。。。
标红色的数字表示我能赢。为什么呢?
比如n=5,判断5时,我们得看1,因为1时我能赢,那么我先取1,那么在后面的2 3 4 5中,不论对面怎么remove,对面都是输,也就是我能赢。
同样比如n=10, 此时我们得看n=6时谁赢,前6个我能赢,那么后4个不论对面怎么remove,对面都输了,那就是我赢了。