292. Nim Game
来源:互联网 发布:成都企业数据库服务器 编辑:程序博客网 时间:2024/05/21 17:20
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.
找规律题
class Solution(object): def canWinNim(self, n): """ :type n: int :rtype: bool """ if n%4==0: return False else: 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
- 以德报怨正解
- 解方程
- 【Linux】纯C环境下字符串的处理
- Linux 下批量修改后缀名
- java中字符串集合排序
- 292. Nim Game
- IOS之简单选择器UIPickerView(省份+城市)
- iOS图片加水印或文字
- 【设计模式】 之 单例模式
- 7款高颜值HTML5播放器:让你的音乐有声有色
- 关于flex同java通信出现的问题
- C++封装、继承、多态
- Wordpress WebFont不显示显示
- Android之计算缓存大小并且清空缓存