leetcode笔记：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颗。谁消除掉最后一个石头即为赢家。假设你是第一轮开始取石头。

现在你们游戏中的每个人都有着非常聪明的头脑和绝佳的策略。写一个函数，对与一个给定的石头数目，算出你是否可以赢得这场比赛。

例如，如果石堆中有4颗石头，那么你永远也无法赢得比赛：无论你移除了1、2或3颗石头，最后1颗石头都会被你的朋友所拿走。

更多关于