leedCode 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)问题分析：

如果在自己的回合中，剩下的stones是4的倍数，那么自己必输，否则可以每次取完石头后剩余4的倍数，那么对方必输。所以如果初始石头数不为4的倍数，那么自己必赢。

java源代码

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