LeetCode 292. Nim Game（博弈论）

292. Nim Game

Easy

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.

Example:

Input: 4
Output: false
Explanation: 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.

题意

简单的Nim博弈。有n个石子，甲先手拿乙后手拿，每次可以拿1-3个，谁拿走最后一个石子谁赢。问双方都按最优策略博弈的情况下给定n计算谁会赢。

思路

结论是当n为4的倍数的时候后手赢，否则先手赢。
证明可以用第二类数学归纳法：
假设n <= 4t时，有“n为4的倍数的时候后手赢，否则先手赢”成立
n = 4t + 1/2/3, 先手拿1/2/3个，转化为n = 4t的问题同时先后手对调，n = 4t时后手赢，即对调后的先手赢
n = 4t + 4, 因为n = 4时是后手赢，因此后手总有办法让自己取到前4个，转化为n = 4t的问题，即后手赢

代码

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