Leetcode-Algorithms 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.

Hint:

If there are 5 stones in the heap, could you figure out a way to remove the stones such that you will always be the winner?

Nim game就是指桌上一共有一定数量的石头，你和对手轮流从中拿去1或2或3个石头，谁先把石头拿完谁就赢了，你先手。 写出一个function return你是否能赢得这个游戏。假设你和对手都不傻，都知道最佳选项。
例如如果一共有5个石头，那么你必输。

class Solution(object):
    def canWinNim(self, n):
        """
        :type n: int
        :rtype: bool
        """
        if n%4:
            return True
        else:
            return False

思路是只要给对手留下四个你就一定赢。