[LeetCode]292.Nim Game
2016-03-02 20:50
281 查看
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.
思路:石子总数为N,每次可移动的最大值为K,若N小于等于K,则先移动石子者获胜,
若N能整除K,则先移动石子者失败,反之获胜。
Java带测试版本
public class Solution {
public boolean canWinNim(int n) {
if(n<4) return true;
else { if (n%4 == 0) return false;
else return true;
}
}
public static void main(String args[]) {
System.out.println("please enter thenumber of the stones");
Scanner input = new Scanner(System.in);
int n = input.nextInt();
boolean win = new Solution().canWinNim(n);
if(win == true) System.out.println("youwill win the game");
else System.out.println("you will losethe game");
}
}
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.
思路:石子总数为N,每次可移动的最大值为K,若N小于等于K,则先移动石子者获胜,
若N能整除K,则先移动石子者失败,反之获胜。
Java带测试版本
public class Solution {
public boolean canWinNim(int n) {
if(n<4) return true;
else { if (n%4 == 0) return false;
else return true;
}
}
public static void main(String args[]) {
System.out.println("please enter thenumber of the stones");
Scanner input = new Scanner(System.in);
int n = input.nextInt();
boolean win = new Solution().canWinNim(n);
if(win == true) System.out.println("youwill win the game");
else System.out.println("you will losethe game");
}
}
相关文章推荐
- 如何Android中加入扫描名片功能
- poj2115 C Looooops 空间 2012-01-14
- pku2185 Milking Grid 2012-01-11
- [leetcode] Insertion Sort List(python)
- HDU 2157 How many ways??(矩阵的快速幂)
- Javascript、js 时间日期时间戳转换
- 密码文件
- HBase分布式安装
- iOS socket编程
- Find your present (2) (位异或)
- 定义自己的错误代码
- 关于notepad++和gcc绑定
- 什么是公有云和私有云
- Isomorphic Strings--JavaScript
- Manthan, Codefest 16 -A Ebony and Ivory
- 批量修改文件名
- ios开发之多线程理论
- Http请求报文和响应报文
- PHP&MySQL(二)——困也得啃书
- HTML5学习