Easy
4071217FavoriteShare
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.
C++:
/*
* @Author: SourDumplings
* @Date: 2019-09-07 20:51:34
* @Link: https://github.com/SourDumplings/
* @Email: changzheng300@foxmail.com
* @Description: https://leetcode.com/problems/nim-game/
*
* 策略就是抢4,为了抢4就抢8,以此类推,即只要抢到4的倍数时候让对方出就稳赢。
* 所以只要n不是4的倍数就稳赢
*/
class Solution
{
public:
bool canWinNim(int n)
{
return n % 4 != 0;
}
};
Java:
/*
* @Author: SourDumplings
* @Date: 2019-09-07 21:09:41
* @Link: https://github.com/SourDumplings/
* @Email: changzheng300@foxmail.com
* @Description: https://leetcode.com/problems/nim-game/solution/
*/
class Solution
{
public boolean canWinNim(int n)
{
return n % 4 != 0;
}
}