第一次做leetcode中Difficulty为easy的题-292

最新推荐文章于 2021-01-22 00:04:01 发布

Liuxyup

最新推荐文章于 2021-01-22 00:04:01 发布

阅读量407

点赞数 1

分类专栏： leetcode

本文链接：https://blog.csdn.net/lxyjilin/article/details/49952595

版权

这篇博客介绍了作者初次尝试LeetCode中的Easy级别题目292 - Nim Game的解题过程。作者通过分析游戏规则发现，当剩余石头数为4的倍数时，先手者无法获胜。因此，通过判断剩余石头数是否能被4整除，可以确定获胜策略。代码实现了一个简单的Java解决方案，并反思了长时间未使用Java导致的基础知识遗忘，强调了保持编程实践的重要性。

摘要由CSDN通过智能技术生成

今天第一次做leetcode中的题，刚开始入门，便选择了难度为easy的292号题。一开始并没有想出来，java很久没有用也快荒废了。最后在大卓哥的提示和帮助下完成了。

题目：

Nim Game My Submissions Question
Total Accepted: 20613 Total Submissions: 41521 Difficulty: Easy
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 ston