Nim Game

开始刷起了LeetCode~~

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.

思路：当这个人轮到4的时候必输，轮到5的时候自己拿一个，把4轮给另一方，则另一方必输，于是每逢4的倍数的时候都是必输。

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

}