292. Nim Game
来源:互联网 发布:linux中文输入法有哪些 编辑:程序博客网 时间:2024/06/16 13:29
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) { 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
- Ajax学习笔记
- javaScript引入方式
- atitit.MIZIAN 陕北方言 特有词汇 大词典 attilax 整理 h--n v1 q31.xlsx
- 微信公众号 “网络出错,轻触屏幕重新加载”
- 【数据结构与算法】六 █算法复杂度█ 二 时间复杂度 递归算法
- 292. Nim Game
- (java)Missing Number
- hbase
- Linux下使用C语言返回年月日
- 常用的数据结构
- 用队列写贪吃蛇(C语言版)
- 程序员的故事 008 编程语言之争
- MFC双缓冲绘图
- linux redis安装