Leetcode: Nim Game

Do you want to play first or after, if you are determined to win.



Similar Problems:


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.

Github: code.dennyzhang.com

Credits To: leetcode.com

Leave me comments, if you have better ways to solve.


## Blog link: https://code.dennyzhang.com/nim-game
class Solution(object):
    def canWinNim(self, n):
        """
        :type n: int
        :rtype: bool
        """
        ## Idea: recursive
        ## Complexity:
        ##  1,2,3 -> true
        ##  4 -> false
        ##  5 -> true
        ##  6 -> true
        ##  7 -> true
        ##  8 -> false
        ##  9 -> true
        ##  10 -> true
        ##  11 -> true
        ##  12 -> false
        return n%4 != 0
linkedin
github
slack

Share It, If You Like It.

One thought on “Leetcode: Nim Game”

Leave a Reply

Your email address will not be published.