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.

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.

Hint:

1. If there are 5 stones in the heap, could you figure out a way to remove the stones such that you will always be the winner?

这道题更像是一个脑筋急转换的题。

如果按常理，写一个递归，必定会遇到栈溢出的问题。

然而当分析，每一轮保证去掉4个时，你就能清楚的知道是否会获胜。

当对手拿掉1个，你拿掉3个；

   对手拿掉2个，你拿掉2个；

   对手拿掉3个，你拿掉1个。

当stones的个数被4整除，所得余数。为1，2，3时，你先手拿掉这些零头，那么剩下的stones数量为4的倍数。然后，胜利就在你的撑握中。

然而，当stones的个数刚好被4整除时。由于你为先手，形势反转为对手就能刚刚好掌握住胜利。

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