自己的解法
class Solution:
def divisorGame(self, n: int) -> bool:
if n <= 1:
return False
m = 1
while m:
# for i in range(1, n):
n = n - 1
if n == 1 and m % 2 == 0:
return False
if n == 1 and m % 2 != 0:
return True
m += 1