Skip to content

Commit 431de78

Browse files
committed
Update nim-game.md
1 parent 2d49154 commit 431de78

1 file changed

Lines changed: 6 additions & 0 deletions

File tree

leetcode/nim-game.md

Lines changed: 6 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1 +1,7 @@
11

2+
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.
3+
4+
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.
5+
6+
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.
7+

0 commit comments

Comments
 (0)