[LeetCode] Nim Game
来源:互联网 发布:拳击 知乎 编辑:程序博客网 时间:2024/05/25 18:09
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.
思路
1.单堆拈游戏:m个棋子,最多可以拿n个。如果m不为(n+1)倍数,则会胜利。
2.多堆拈游戏:包含 I > 1 堆棋子,在一堆中拿任意多个。如果每堆棋子数量的二进制数位和非0,则会胜利。
Java代码
public class Solution { public boolean canWinNim(int n) { return n % 4 != 0; }}
- Nim Game leetcode 292
- leetcode Nim Game
- [LeetCode 292] Nim Game
- leetcode | Nim Game
- leetcode 292---NIM GAME
- [leetcode] 292.Nim Game
- LeetCode:Nim Game
- leetcode-292-Nim Game
- LeetCode-Nim Game
- *LeetCode-Nim Game
- LeetCode Nim Game
- LeetCode之Nim Game
- 【Leetcode】Nim Game
- LeetCode 292----Nim Game
- LeetCode:Nim Game
- LeetCode -- Nim Game
- LeetCode--Nim Game
- [Leetcode] Nim Game
- Java的abstract类与接口的比较
- 逻辑回归Logistic Regression 之基础知识准备
- PHP-点滴记录
- VK Cup 2016 - Round 1 (Div. 2 Edition)-B - Bear and Displayed Friends-STL(维护前k大)
- JavaSe基础(2)-- 分支结构
- [LeetCode] Nim Game
- java微信支付实现流程
- 16-3-28华为校招体验题答案,思考和总结
- 漫谈:机器学习中距离和相似性度量方法
- win7设置环境变量需要重启生效问题
- 初步理解反射机制
- web自动化测试框架目录
- 来段代码提提神-那些无法回避的知识点之线程和进程之间关系,并发的选择!
- JavaSe基础(3)-- 循环结构