292. Nim Game [easy] (Python)

题目链接

https://leetcode.com/problems/nim-game/

题目原文

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.

题目翻译

你在跟朋友玩“Nim游戏“：桌子上有一堆石头，每次你和你的朋友轮流从中拿走1到3个石头。拿走最后一个石头的人获得游戏胜利。每次游戏都由你先拿石头。
你们俩都非常聪明，都知道这个游戏的最优策略。写一个函数，给定这一堆石头