@@ -0,0 +1,715 @@
+/**%0A *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.%0A *%0A *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.%0A *%0A *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.%0A */%0Aclass Solution %7B%0A    public boolean canWinNim(int n) %7B%0A        return n %25 4 != 0;%0A    %7D%0A%7D%0A

Create NimGame.java