本文主要是介绍LeetCode刷题：403. Frog Jump 青蛙过河问题JAVA算法设计，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！
LeetCode刷题：403. Frog Jump 青蛙过河问题JAVA算法设计
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:
The number of stones is ≥ 2 and is < 1,100.
Each stone's position will be a non-negative integer < 231.
The first stone's position is always 0.
Example 1:
[0,1,3,5,6,8,12,17]
There are a total of 8 stones.
The first stone at the 0th unit, second s
这篇关于LeetCode刷题：403. Frog Jump 青蛙过河问题JAVA算法设计的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！
