leetcode 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到3步，由你开始，判断是否可以赢。输入石头的个数  n
问题的核心就是，当只剩4个石头的时候，移动的人是谁。只要营造最后剩4个的情况即可。

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