Leetcode: Nim Game
来源:互联网 发布:线切割编程教学视频 编辑:程序博客网 时间:2024/06/05 21:09
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 {public: bool canWinNim(int n) { return (n & 0x3) != 0; }};
0 0
- Nim Game leetcode 292
- leetcode Nim Game
- [LeetCode 292] Nim Game
- leetcode | Nim Game
- leetcode 292---NIM GAME
- [leetcode] 292.Nim Game
- LeetCode:Nim Game
- leetcode-292-Nim Game
- LeetCode-Nim Game
- *LeetCode-Nim Game
- LeetCode Nim Game
- LeetCode之Nim Game
- 【Leetcode】Nim Game
- LeetCode 292----Nim Game
- LeetCode:Nim Game
- LeetCode -- Nim Game
- LeetCode--Nim Game
- [Leetcode] Nim Game
- 十、c++ vector 删除指定元素
- 高仿物流唐山iOS客户端——序
- MongoDB3.0发布--新特性
- Python第三方库使用——splinter
- 理解RESTful架构
- Leetcode: Nim Game
- 简单网络问题的解决思路
- JAVA反序列化exp及使用方法
- Android应用setContentView与LayoutInflater加载解析机制源码分析
- -bash: vim: command not found.
- 2015.12.9
- android-make
- win7下android-studio中Ctrl+space代码快捷提示没用起作用
- Linux配置管理