LeetCode oj 292. Nim Game（尼姆博奕）

292. Nim Game

 

QuestionEditorial Solution

 My Submissions

• Total Accepted: 100010
• Total Submissions: 184472
• 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.

尼姆博奕

最水的尼姆博弈，写几个样例就出来了，如果n-4是必胜态，那么不论接下来对方选几个，n一定是必胜态，所以判断n%4是不是0就行了

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