Leetcode: 292. Nim Game (Java)

【问题描述】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.

【思路】因为没人都取超不过4个，两种情况，

case1：如果我们后走，每次与前者取总和为4的石头，可保证每轮都取走了4个。如果最后刚好取完则我胜利，否则对方胜利

case2：如果我们先走，则每次取总数除以4取余的石头，无论如何都会剩下4个，则我方肯定会胜利。正式此题要求。即总数如果除以4取余为0，则我方肯定会输，否则胜利。

package algorithm;

import java.util.Scanner;

public class NimGame {
	
	/**
	 * 测试函数
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		while (true) {
			int n = in.nextInt();
			boolean tag = canWinNim(n);
			System.out.println(n + ":\t" + tag);
		}
	}

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

}