292. Nim Game
来源:互联网 发布:淘宝宝贝去哪里点发货 编辑:程序博客网 时间:2024/06/05 14:00
题目来源【Leetcode】
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.
找到这个题的规律就会发现只要能被4整除的数就赢不了
class Solution {public: bool canWinNim(int n) { if(n % 4 == 0) return false; 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
- Android学习(十一)RadioButton和RadioGroup
- VBScript技巧
- 自用基础5-数组+for each
- leetcode(7) reverse integer
- IOS部分异常处理
- 292. Nim Game
- ES6(一)const与let
- 输入两棵二叉树A,B,判断B是不是A的子结构。
- HTML5基础
- POI导出Excel样式
- java每日练习-1
- JavaScript难点——立即执行函数(二)
- poj2594 Treasure Exploration【最小路径覆盖】
- springMVC数据格式转换的三种实现