292. Nim Game
来源:互联网 发布:薛之谦在淘宝开的店铺 编辑:程序博客网 时间:2024/06/15 20:16
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?
思路:分析一下,如果石头个数是4的倍数的话,则必输(对方也足够聪明,策略最佳)。
class Solution {public: bool canWinNim(int n) { if((n&3) == 0) return false; else return true; }};
0 0
- [leetcode] 292.Nim Game
- 【LeetCode】292.Nim Game
- 292. Nim Game
- leetcode:292. Nim Game
- 292. Nim Game
- 292. Nim Game
- 292. Nim Game
- leetCode 292. Nim Game
- 292. Nim Game LeetCode
- 292. Nim Game
- LeetCode 292. Nim Game
- LeetCode 292. Nim Game
- LeetCode 292.Nim Game
- LeetCode 292. Nim Game
- 292. Nim Game
- 292. Nim Game
- 292. Nim Game
- 292. Nim Game
- 【设计模式】单例模式实践应用
- 通过贝塞尔路径画一条线
- 最全VR产业链全景图
- Spring Batch(6) : ItemReader & ItemWriter
- 51 nod 1092 回文字符串
- 292. Nim Game
- 绘图时候截取部分绘制
- 计算机
- 绘制文字,设置阴影效果
- Assigning retained object to weak variable
- PageRank算法的python实现
- Java中的栈操作
- 有多个手势支持时候需要实现UIGuestrueRecoginer方法
- 前端框架和引擎简述