292. Nim Game

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个石头。除去最后一块石头的人将是胜利者。你是第一个移除石头的。你们两个都很聪明，对游戏有最佳的策略。写一个函数，判断你是否能赢得游戏中给定的石头数。例如，如果有4个石头堆，那么你永远不会赢得比赛：无论1，2，或你删除石头，最后的石头将永远被你的朋友移除。

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

tip:根据题目中的暗示，可以发现4的倍数，第一个人都不能赢，因为无论你取1,2,3，都可以被4取余等于3,2,1，那样后面的人总能是最后一个移除完石头