Leetcode学习（33）—— 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 的倍数，则他必输。

当 n 是 4 的倍数时，每次 B 都有办法使得 A+B = 4，以至于 A 输

当 n 不是 4 的倍数的时候，A 拿走 n % 4 的部分，这样 B 将面对之前 A 所面对的情况，以至于 B 输

class Solution(object):
    def canWinNim(self, n):
        return n % 4 != 0