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.

Hint:

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?

思路：

按照提示，谁最后拿的时候剩下四个子必输。

class Solution
{
public:
    bool canWinNim(int n) 
    {
        if(n <=0 )
         return false;
         
        return (n%4 == 0 ? false : true);
    }
};

总结：

1、好久没刷LeetCode了，今天刷刷找找感觉。

2、还是思路，思路对了，代码就是对的。

3、一次通过，爽！不过这道题确实太简单了。