LeetCode 292
2016-04-24 23:18
232 查看
Nim Game
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.
Hint:
If there are 5 stones in the heap, could you figure out a way to remove the stones such that you will always be the winner?
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.
Hint:
If there are 5 stones in the heap, could you figure out a way to remove the stones such that you will always be the winner?
public class Solution { public boolean canWinNim(int n) { if(n%4 == 0) { return false; } else { return true; } } }
/************************************************************************* > File Name: LeetCode292.c > Author: Juntaran > Mail: JuntaranMail@gmail.com > Created Time: Tue 10 May 2016 07:30:06 PM CST ************************************************************************/ /************************************************************************* Nim Game 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. Hint: If there are 5 stones in the heap, could you figure out a way to remove the stones such that you will always be the winner? ************************************************************************/ #include <stdio.h> int canWinNim( int n ) { int ret = 0; if( n%4 != 0 ) { ret = 1; } return ret; } int main() { int n = 5; int ret = canWinNim(n); printf("%d\n", ret); return 0; }
相关文章推荐
- nginx+tomcat 负载均衡
- 《一个定理的诞生》感
- 20145221 《Java程序设计》实验报告三:敏捷开发与XP实践
- 20145214实验三 敏捷开发与XP实践
- 搜狗输入法使用评价
- Java中的static关键字
- Linux内核学习总结
- 第10章 外部性
- Python3.4的面向对象
- LeetCode 283
- LeetCode *** 143. Reorder List
- WebService可用公用接口
- 20145210 《Java程序设计》第08周学习总结
- 附加2
- redis 数据持久化
- 20145322《Java程序设计》第3次实验报告
- LeetCode 263
- 二叉树、二叉搜索树、AVL树的java实现
- UITableView的使用
- Java基础系列15:JDBC中使用元数据分析数据库