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.
class Solution {
public:
bool canWinNim(int n) {
if(n%4==0)
return false;
else
return true;
}
};
思路是:因为是我先取,所以我可以第一次取模4后的余数,然后接下来剩下的数就是4的整数了。。。。每一次朋友取k(k=1,2,3),我都取4-k。一个来回就是个循环,依次进行下去,反正朋友取不了4,所以总会有剩下的,我把剩下的去掉我就赢了。。。