# 第一次做leetcode中Difficulty为easy的题-292

Nim Game My Submissions Question
Total Accepted: 20613 Total Submissions: 41521 Difficulty: Easy
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.
Hint:
If there are 5 stones in the heap, could you figure out a way to remove the stones such that you will always be the winner?

public class Solution {
public boolean canWinNim(int n) {
if (n<=0||n%4==0){
return false;
}
else{
return true;

}
}
}

1.代码非常简单，但是由于长时间没有使用Java（平时写算法都用对语法不严格的MATLAB），最基本的输入输出以及方法的定义都不记得了。应加强训练。

2.题目本身并不难，在解决问题的时候注意不要将问题复杂化。

• 本文已收录于以下专栏：

举报原因： 您举报文章：第一次做leetcode中Difficulty为easy的题-292 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)