leetcode -- Nim Game

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-10个石头的情况下先手的输赢

1 -> win

2 -> win

3 -> win

4 -> lose

5 -> win

6 -> win

7 -> win

8 -> lose

9 -> win

10 -> win

因而当石头个数为4的倍数时先手必输，其他情况下都能赢

 

转载于:https://www.cnblogs.com/feiling/p/4881332.html