jump-game

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

Algorithms

You are given an integer array <code>nums</code>. You are initially positioned at the array&#39;s first index, and each element in the array represents your maximum jump length at that position.

Return <code>true</code> if you can reach the last index, or <code>false</code> otherwise.

&nbsp;
Example 1:

<pre>
Input: nums = [2,3,1,1,4]
Output: true
Explanation: Jump 1 step from index 0 to 1, then 3 steps to the last index.
</pre>

Example 2:

<pre>
Input: nums = [3,2,1,0,4]
Output: false
Explanation: You will always arrive at index 3 no matter what. Its maximum jump length is 0, which makes it impossible to reach the last index.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 104</code></li>
	<li><code>0 &lt;= nums[i] &lt;= 105</code></li>
</ul>