leetcode -- Nim Game -- 简单要看

d = [1,1,1,-1]

i = 4
while i < n:
tmp = max(-d[i - 1], -d[i - 2], -d[i - 3])
d.append(tmp)
i += 1
if d[n-1] == 1:
return True
else:
return False

class Solution(object):
def canWinNim(self, n):
"""
:type n: int
:rtype: bool
"""

if n % 4 == 0:
return False
else:
return True

return n % 4 > 0