【leetcode】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个还是3个，你都赢不了。如果有5个石头，那么当你取走一个之后，还剩4个石头，不管对手怎么取，你都能赢。如果有6个石头，你可以取走2个，对手必输。如果有7个石头，你可以取走3个，对手必输。如果有8个石头，不管你第一步取走几个，对手都可以再次造成4个的情况，让你输。也就是说，只要石头的数目不是4的倍数，你就能赢。因此这个题目的答案非常简单。

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