[Leetcode] 403. Frog Jump 解题报告

最新推荐文章于 2021-04-29 23:16:09 发布

魔豆Magicbean

最新推荐文章于 2021-04-29 23:16:09 发布

阅读量711

点赞数

分类专栏： IT公司面试习题文章标签：解题报告 Leetcode DFS Dynamic Programming

本文链接：https://blog.csdn.net/magicbean2/article/details/77892093

版权

这篇博客讨论了LeetCode上的403题——Frog Jump，探讨了青蛙过河的问题，涉及到动态规划和深度优先搜索（DFS）策略。博主指出，由于状态转移依赖上一步跳跃距离，普通DP不适合。文章详细解释了两种方法：1) 暴力DFS解法，但因存在重复计算而不完全有效；2) 记录步长集合的方法，可以避免重复计算并判断青蛙是否能到达最后一块石头。最后，博主给出了代码实现。

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

题目：

A frog is crossing a river. The river is divided into x units and at each unit there may or may not exist a stone. The frog can jump on a stone, but it must not jump into the water.

Given a list of stones' positions (in units) in sorted ascending order, determine if the frog is able to cross the river by landing on the last stone. Initially, the frog is on the first stone and assume the first jump must be 1 unit.

If the frog's last jump was k units, then its next jump must be either k - 1, k, or k + 1 units. Note that the frog can only jump in the forward direction.

Note: