【LeetCode】 292. Nim Game
来源:互联网 发布:淘宝澳洲代购推荐 编辑:程序博客网 时间:2024/06/05 08:36
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.
Hint:
- If there are 5 stones in the heap, could you figure out a way to remove the stones such that you will always be the winner?
public class Solution { public boolean canWinNim(int n) { return !(n % 4 == 0); }}
0 0
- [leetcode] 292.Nim Game
- 【LeetCode】292.Nim Game
- leetcode:292. Nim Game
- leetCode 292. Nim Game
- 292. Nim Game LeetCode
- LeetCode 292. Nim Game
- LeetCode 292. Nim Game
- LeetCode 292.Nim Game
- LeetCode 292. Nim Game
- [LeetCode]292.Nim Game
- <LeetCode> 292. Nim Game
- leetcode-292.Nim Game
- LeetCode 292. Nim Game
- LeetCode *** 292. Nim Game
- leetcode 292. Nim Game
- Leetcode 292. Nim Game
- 292.[LeetCode]Nim Game
- 【leetcode】292. Nim Game
- C语言实验——保留字母
- 【hpuoj】大数A+B
- 历史上的重大软件BUG启示录第7篇---美国商务航空公司的烦恼
- LA 4064 Magnetic Train Tracks (极角排序)
- 4006: [JLOI2015]管道连接
- 【LeetCode】 292. Nim Game
- 基于TI-RTOS的CC2650DK开发(17)---支持模块
- 【hpuoj】天平平衡
- 第1章 形成Becoming
- C语言实验——大小写转换
- 三部排序
- 【hpuoj】KACA的数字排序
- bzoj 2463: [中山市选2009]谁能赢呢? (博弈)
- javascript : spket 视频教程