[算法相关] LeetCode——Nim Game

这是第二天的的编码，题目如下：

 

. Nim Game

 

Total Accepted: 30590  Total Submissions: 60866  Difficulty: 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.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.

题目是简单级别的，亏我还想了一个晚上，简直都崩溃了。意思是一堆石头，你和朋友依次

从其中分别拿去不大于三个的石头，自己是第一个，判断那堆石头数的个数是多少的时候

你是可以稳赢。此题的思考过程浪费了太多脑细胞，早晨我吃饭完，想到了可能的结果。

结果就是这样。然后我的程序就是下面这样：

<pre name="code" class="java">public static boolean canWinNim(int n) {
		 int m, y = 0;
		 for( m = 1; m <= 3; m++){
			if(( n-m)%4 ==0)	 return true; 
		 } for( y = 0; y <= 3; y++){
					 if((n-m-y)%4 == 0){
						 return false;
					 }
				 } 	
		  return false;
	        }

 

经测试，这个结果是对的，开心ing，然后我就点开discuss，我发现别人的程序都是这样的：

 

 

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

一万只草泥马飘过……………………6……………………