问题描述：

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.

解题思路：

这道题比较简单，就是判断给定的n是否为4的倍数。

如果n为4的倍数，那么作为先手，是没有机会获胜的，因为每次我走完，那么对方只要走的数目跟我这次相加为4即可。

如果n不为4的倍数，那么我第一次拿走的数目使得剩余的数目为4的倍数，这样就变成了前一种情况，只不过这次轮到我是后来走的人。

代码如下：

public class Solution {

    public boolean canWinNim(int n) {

		if (n % 4 == 0)

			return false;

		else

			return true;

	}

}