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.
思路:找规律,从(4-5-6-7)情况推知其他所有,能被4整除,我输,其他情况我赢代码1:
class Solution {
public:
bool canWinNim(int n) {
if(n%4){
return true;
}
else {
return false;
}
}
};
代码2:
class Solution {
public:
bool canWinNim(int n) {
return n%4==0? false:true;
}
};
代码3:
class Solution {
public:
bool canWinNim(int n) {
return (n%4);
}
};