FilesExpand file tree

 master

/

_292NimGame.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

12 lines (12 loc) · 729 Bytes

 master

/

_292NimGame.java

Copy path

Top

File metadata and controls

• Code
• Blame

12 lines (12 loc) · 729 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

/**

* 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.

*/

public class _292NimGame {

public boolean canWinNim(int n) {

return n % 4 != 0;

}

}