leetcode 292. Nim Game
来源:互联网 发布:淘宝精品推荐怎么弄 编辑:程序博客网 时间:2024/06/07 01:55
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的倍数上来。
public class Solution { public boolean canWinNim(int n) { return n%4 !=0; }}
0 0
- [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
- HTML 5 画布的实现
- Caffe 深度学习框架
- ofbiz_web设置
- js学习笔记:this
- Linked Lists Part1-Singly Linked Lists
- leetcode 292. Nim Game
- Android搜索框架
- 【JAVA学习】——Java虚拟机
- 算法提高 一元一次方程
- 100道动态规划——21 HDU 1559 最大子矩阵和 树状数组 最大连续子区间和
- HDU 1435 Stable Match(稳定婚姻问题)
- [Leetcode] Find All Duplicates in an Array
- C++重要知识点
- 半文不白的语言