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.

这个也就是说有那么一堆石头，大家来取石头，每人最多取3块，至少也得拿一块，就看谁拿最后一块谁就能赢，但是你总是第一个拿。

现在让你写个程序：如果已经给了你这堆石头的数量，那你就得判断你是否能赢得比赛？

刚刚已经被虐的不行不行的啦，没想到会遇到这么简单的题！

    if(n%4 == 0)

    {

        return false;

    }

    return true;

        

    }

但是还可以写的更简单直接return (n%4) !=0;