292. 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.

我是这么思考的，总共有两个人，你先拿的话，如果数量小于三个，那么一定会获得胜利

如果数量大于三个的话，可以先拿三个，然后让另一个人拿，这么办的话我能够保证我俩一次一共能拿多少个，我俩都是最多拿三个，最少拿一个，那么我完全可以控制俩人总共拿4个，也就是说前面都是四个四个一组循环，到了最后，能被四整除的话那就肯定可以胜利，如果不能的话那就失败了。

class Solution(object):    def canWinNim(self, n):        """        :type n: int        :rtype: bool        """        if n <= 3:            return True        else:            q = n - 3            if q % 4 == 0:                return True            else:                return False