[LeetCode]292. Nim Game
来源:互联网 发布:淘宝买火车票靠谱吗 编辑:程序博客网 时间:2024/04/25 23:34
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.
0ms:
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
- 互斥锁与条件变量
- 快速排序法 C++
- 将Ubuntu的“桌面”改为“Desktop”
- MySQL数据库对GROUP BY子句的功能扩展(1)
- Linux应用随笔(一)Debian8入门
- [LeetCode]292. Nim Game
- 【第三周】第三章实验2猜数字游戏
- 九度1083 特殊乘法
- HDU 2094 产生冠军 (map)
- Firebase介绍(只管写代码,后台交给Firebase)
- Linux版本简介
- Android ViewPager>Fragment>Listview>addHeaderView添加轮播图隐藏bug
- HTML&CSS编码规范
- 动态规划(Unidirectional TSP,uva 116)