尼姆博弈


LeetCode:Nim Game

落爺英雄遲暮 提交于 2019-12-06 02:41:56
1、题目名称 Nim Game(尼姆博弈) 2、题目地址 https://leetcode.com/problems/nim-game/ 3、题目内容 英文: 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

工具导航Map