# LeetCode 292 Nim Game（Nim游戏）

## 翻译

你正在和你的朋友们玩下面这个Nim游戏：桌子上有一堆石头，每次你从中去掉1-3个。谁消除掉最后一个石头即为赢家。你在取出石头的第一轮。

## 原文

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.

## 分析

bool yourTrun = true;

1-true
2-true
3-true
4-false
5-true
6-true
7-true
8-false

bool canWinNim(int n) {
if ((n - 1) % 4 == 0 || (n - 2) % 4 == 0 || (n - 3) % 4== 0) return true;
else return false;
}

bool canWinNim(int n) {
return (n - 1) % 4 == 0 || (n - 2) % 4 == 0 || (n - 3) % 4 == 0;
}

bool canWinNim(int n) {
return n % 4 != 0;
}

## 代码

class Solution {
public:
bool canWinNim(int n) {
return n % 4 != 0;
}
};