Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit e06de70

Browse files
Update nim-game.md
1 parent e56da3c commit e06de70

1 file changed

Lines changed: 3 additions & 0 deletions

File tree

‎leetcode/nim-game.md‎

Lines changed: 3 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -5,3 +5,6 @@ Both of you are very clever and have optimal strategies for the game. Write a fu
55

66
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.
77

8+
Hint:
9+
10+
If there are 5 stones in the heap, could you figure out a way to remove the stones such that you will always be the winner?

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /