LeetCode 292. Nim Game
来源:互联网 发布:windows xp的外观设置 编辑:程序博客网 时间:2024/06/05 20:43
292. Nim Game
Total Accepted: 59733 Total Submissions: 113879 Difficulty: Easy
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,2,3那就可以通过。如果是4一定不能赢,所以如果是5,6,7可以想办法分别取1,2,3让乙来一定不能赢,所以5,6,7甲是可以赢的。
如果是8,则无论甲选任何个数,都能让乙来面临7,6,5这些必赢的选项所以甲一定输。
如果是9,10,11,则甲可以通过让乙来面临8来一定输。
如果是12,则甲无论选取任何个数,都能让乙面临9,10,11这样的一定可以赢的数字,所以12让甲必定输。
以此类推发现规律,在4或者4的倍数的时候,甲无论怎样一定输。
所以就简单一句:return n % 4;
*/
class Solution {public: bool canWinNim(int n) { return n % 4; }};
- [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
- 即使是没有结果的爱恋,我依然会选择你
- 二分查找——B:Can you solve this equation? 解题报告
- CF 14 problem D - Two paths
- 离散数学中输出律的证明:(P∧Q→R)恒等于(P→(Q→R))
- POJ 1325 Machine Schedule 二分图 最小覆盖
- LeetCode 292. Nim Game
- CORS(跨域资源共享)简介。。。ie67不支持
- ERROR 1819 (HY000): Your password does not satisfy the current policy requirements
- mysql导入导出 (未测试)
- iOS 使用AFN 进行单图和多图上传
- xcode 中不小心删除 stroryboard 的恢复办法
- JavaScript计算指定日期与当前日期的相差天数(未测试)
- Web服务器之Nginx详解(操作部分)
- 字母雨的实现