292. Nim Game
来源:互联网 发布:mac不进系统打开终端 编辑:程序博客网 时间:2024/06/15 21:05
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.
public class Solution { public boolean canWinNim(int n) { return n % 4 != 0; }}
阅读全文
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
- poi写出报表
- 最小路径覆盖
- Java 注解
- touchjs
- 各选择器的返回值
- 292. Nim Game
- C++学习笔记-----std::string的=,+,+=对int,char类型操作数的支持
- html2canvas跨域问题的简单解决方法
- jenkins构建自动部署(二)
- python之读写csv文件
- 部署war包到Tomcat
- 测试浏览器与OpenSSL的双向认证
- 阿里巴巴js面试题2
- zabbix 1