题目描述
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.
Example:
Input: 4
Output: false
Explanation: 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.
Qiang的思路
class Solution:
def canWinNim(self, n: int) -> bool:
return False if n % 4 == 0 else True
#dp = [False, True, True, True]
#for i in range(4, n+1):
# dp.append(False if (True==dp[i-1]) and (True==dp[i-2]) and (True==dp[i-3]) else True)
#return dp[n]
