Description：

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.

有一堆石头，两个人轮流取，一次只能取1~3个，取得最后一个石头的人赢。给一个整数n判断是不是能赢。

这个问题其实是一个著名的博弈论的问题，但是这个地方有点简单，列出来前12个答案就能找出规律，就是只要是4的倍数都不可能赢。

Nim Game:   

 

代码：

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