LeetCode第292題(Nim Game)
1002 ワード
LeetCode第292題(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.
いくつかの石を、二人で交互に取って、毎回1~3個しか取れません.最後の石を取った人は負けた.では、最も優れた戦略は、いくつかの石を取った後に残った石が4の倍数であることです.この原則に基づいて、このテーマはとても簡単です.
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.
いくつかの石を、二人で交互に取って、毎回1~3個しか取れません.最後の石を取った人は負けた.では、最も優れた戦略は、いくつかの石を取った後に残った石が4の倍数であることです.この原則に基づいて、このテーマはとても簡単です.
bool canWinNim(int n)
{
return (n % 4 ！= 0);
}