292. Nim Game*
来源:互联网 发布:诸神黄昏进阶数据 编辑:程序博客网 时间:2024/06/09 16:42
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.
My code:
class Solution(object): def canWinNim(self, n): """ :type n: int :rtype: bool """ return n%4 !=0
class Solution(object): def canWinNim(self, n): """ :type n: int :rtype: bool """ return n&3 !=0Reference:http://blog.csdn.net/coder_orz/article/details/51364901
Note: This problem is a math problem. Never be confused by the statement
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
- HTML5 <script>标签中的async和defer
- 项目属性 多线程 dll 和 多线程 的区别
- 区别观察者模式
- VS编译选项中的MT,MTD,MD,MDD
- Linux命令 --- 登入登出篇
- 292. Nim Game*
- Android Studio 优秀插件
- 初识spring(九)
- 提高Android Studio/Gradle编译速度的配置
- JMeter之分布式部署
- SDUT 2804 求二叉树的深度
- dos批处理文件的编写
- Hdu oj 1556 Color the ball(树状数组区间更新转单点更新)
- 如何学好web安全