292. Nim Game
来源:互联网 发布:cad软件培训班 编辑:程序博客网 时间:2024/06/14 18:13
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
- 大数据究竟是什么?一句话让你认识并读懂大数据
- rdkafka 保存offset到本地文件
- 258. Add Digits
- spool 2
- Java EL表达式
- 292. Nim Game
- 数据结构中的各种排序---总结篇
- python的GUI编程--wxpython学习(一)--安装和原理步骤
- JAVA WEB 之 XML(1)
- char类型范围
- 自写字符串操作函数
- 326. Power of Three
- 自写内存操作函数
- e不会的大端小端存储模式