mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 11:43:12 +08:00
47 lines
1.5 KiB
HTML
47 lines
1.5 KiB
HTML
<p>Given an array of integers <code>arr</code>, you are initially positioned at the first index of the array.</p>
|
|
|
|
<p>In one step you can jump from index <code>i</code> to index:</p>
|
|
|
|
<ul>
|
|
<li><code>i + 1</code> where: <code>i + 1 < arr.length</code>.</li>
|
|
<li><code>i - 1</code> where: <code>i - 1 >= 0</code>.</li>
|
|
<li><code>j</code> where: <code>arr[i] == arr[j]</code> and <code>i != j</code>.</li>
|
|
</ul>
|
|
|
|
<p>Return <em>the minimum number of steps</em> to reach the <strong>last index</strong> of the array.</p>
|
|
|
|
<p>Notice that you can not jump outside of the array at any time.</p>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> arr = [100,-23,-23,404,100,23,23,23,3,404]
|
|
<strong>Output:</strong> 3
|
|
<strong>Explanation:</strong> You need three jumps from index 0 --> 4 --> 3 --> 9. Note that index 9 is the last index of the array.
|
|
</pre>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> arr = [7]
|
|
<strong>Output:</strong> 0
|
|
<strong>Explanation:</strong> Start index is the last index. You do not need to jump.
|
|
</pre>
|
|
|
|
<p><strong>Example 3:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> arr = [7,6,9,6,9,6,9,7]
|
|
<strong>Output:</strong> 1
|
|
<strong>Explanation:</strong> You can jump directly from index 0 to index 7 which is last index of the array.
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= arr.length <= 5 * 10<sup>4</sup></code></li>
|
|
<li><code>-10<sup>8</sup> <= arr[i] <= 10<sup>8</sup></code></li>
|
|
</ul>
|