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的倍数,那么你就能获胜。比如有9块,你就需要先报1(9%4),然后无论对方m,你报的数n=4-m,然后还剩4,对方怎么报你都能赢。
class Solution {
public:
bool canWinNim(int n) {
if(n%4 == 0)
return false;
return true;
}
};
再贴一下别人的代码,意思是一样的
bool canWinNim(int n) {
return n % 4 != 0;
}