Leetcode292-Nim game

今天在leetcode上碰到一个很”有意思“的题，题目是这样的：

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.

 

Example:

Input: 4
Output: false 
Explanation: 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.

 

这个题的意思是桌面上有一堆石头，两个人每次拿一到三个，拿到最后一个石头的胜利，你先拿，根据石头个数确定你是否能赢。

 

这次乍一看仿佛很难

 

class Solution {
    public boolean canWinNim(int n) {
        if(n%4 ==0)
            return false;
        else
            return true;
    }
}