mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
46 lines
2.3 KiB
HTML
46 lines
2.3 KiB
HTML
|
<p>You are given a <strong>0-indexed</strong> integer array <code>stones</code> sorted in <strong>strictly increasing order</strong> representing the positions of stones in a river.</p>
|
||
|
|
|
||
|
|
<p>A frog, initially on the first stone, wants to travel to the last stone and then return to the first stone. However, it can jump to any stone <strong>at most once</strong>.</p>
|
||
|
|
|
||
|
|
<p>The <strong>length</strong> of a jump is the absolute difference between the position of the stone the frog is currently on and the position of the stone to which the frog jumps.</p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li>More formally, if the frog is at <code>stones[i]</code> and is jumping to <code>stones[j]</code>, the length of the jump is <code>|stones[i] - stones[j]|</code>.</li>
|
||
|
|
</ul>
|
||
|
|
|
||
|
|
<p>The <strong>cost</strong> of a path is the <strong>maximum length of a jump</strong> among all jumps in the path.</p>
|
||
|
|
|
||
|
|
<p>Return <em>the <strong>minimum</strong> cost of a path for the frog</em>.</p>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong class="example">Example 1:</strong></p>
|
||
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2022/11/14/example-1.png" style="width: 600px; height: 219px;" />
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> stones = [0,2,5,6,7]
|
||
|
|
<strong>Output:</strong> 5
|
||
|
|
<strong>Explanation:</strong> The above figure represents one of the optimal paths the frog can take.
|
||
|
|
The cost of this path is 5, which is the maximum length of a jump.
|
||
|
|
Since it is not possible to achieve a cost of less than 5, we return it.
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p><strong class="example">Example 2:</strong></p>
|
||
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2022/11/14/example-2.png" style="width: 500px; height: 171px;" />
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> stones = [0,3,9]
|
||
|
|
<strong>Output:</strong> 9
|
||
|
|
<strong>Explanation:</strong>
|
||
|
|
The frog can jump directly to the last stone and come back to the first stone.
|
||
|
|
In this case, the length of each jump will be 9. The cost for the path will be max(9, 9) = 9.
|
||
|
|
It can be shown that this is the minimum achievable cost.
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Constraints:</strong></p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li><code>2 <= stones.length <= 10<sup>5</sup></code></li>
|
||
|
|
<li><code>0 <= stones[i] <= 10<sup>9</sup></code></li>
|
||
|
|
<li><code>stones[0] == 0</code></li>
|
||
|
|
<li><code>stones</code> is sorted in a strictly increasing order.</li>
|
||
|
|
</ul>
|