LeetCode || Nim Game

题目链接：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.

基本思想：

题目大致意思是：总共有N个球，A首先拿多少个球，然后B拿多少个球，单次拿球数量为1——3个之间，判断N为多少时A球必定能赢。

这道题目的类似版本在很多公司面试中出现。

主要是运用每次A拿m（1<=M<=3）个球，然后B拿4-m个球的思想来处理。

那么，可以轻松将这道题目转变为，当总球数量N为能被4整除时，则B必定会赢，反之A会赢。

代码如下：

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