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.<\/p>\n
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.<\/p>\n
Example:<\/strong><\/p>\n Python<\/strong><\/p>\nInput:<\/strong>
4<\/code> Output:<\/strong> false Explanation: <\/strong>If there are 4 stones in the heap, then you will never win the game; \u00a0 No matter 1, 2, or 3 stones you remove, the last stone will always be \u00a0 removed by your friend.<\/pre>\n \r\nclass Solution(object):\r\n def canWinNim(self, n):\r\n """\r\n :type n: int\r\n :rtype: bool\r\n """\r\n if n % 4 == 0:\r\n return False\r\n else:\r\n return True\r\n \r\n<\/pre>\n","protected":false},"excerpt":{"rendered":"