292. Nim Game
来源:互联网 发布:网络运营公司赚钱吗 编辑:程序博客网 时间:2024/06/06 18:31
题目:
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.
解答:
博弈论中极为经典的尼姆游戏。有总数为n的石头,每个人可以拿1~m个石头,两个人交替拿,拿到最后一个的人获胜。究竟是先手有利,还是后手有利?
- 1个石子,先手全部拿走;
- 2个石子,先手全部拿走;
- 3个石子,先手全部拿走;
- 4个石子,后手面对的是先手的第1,2,3情况,后手必胜;
- 5个石子,先手拿走1个让后手面对第4种情况,后手必败;
- 6个石子,先手拿走2个让后手面对第4种情况,后手必败;
- ……
容易看出来,只有当出现了4的倍数,先手无可奈何,其余情况先手都可以获胜。
(石子数量为4的倍数)后手的获胜策略十分简单,每次取石子的数量,与上一次先手取石子的数量和为4即可;
(石子数量不为4的倍数)先手的获胜策略也十分简单,每次都令取之后剩余的石子数量为4的倍数(4*0=0,直接拿光),他就处于后手的位置上,利用上一行的策略获胜。
代码极为简单(看了上面解释自己做出来的,思想最重要):
阅读全文
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
- Count Inversions in an array (求数组中的逆序对个数)
- android studio 不支持HttpClient
- LeetCode-88. Merge Sorted Array
- Hbase初始化并根据RowKey获取数据
- 3-1 Point类的构造函数
- 292. Nim Game
- cookie存储及取出时间问题
- bzoj 5091: 摘苹果
- 嵌入式六部曲
- python 第三课
- 设置Hbase的环境变量
- error:src refspec master does not match any
- 网络Cisco实验-交换机路由器综合实验(静态路由)
- ListView 更改表头字体颜色