Given an array of non-negative integers, you are initially positioned at the first index of the array.
Each element in the array represents your maximum jump length at that position.
Determine if you are able to reach the last index.
- Example 1:
Input: [2,3,1,1,4]
Output: true
Explanation: Jump 1 step from index 0 to 1, then 3 steps to the last index. - Example 2:
Input: [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.
解法一——动态规划
用dp[i]表示在到达i位置之后还剩下多少步,则dp[i]的值为前一个位置剩下的步数与前一个位置能跳的步数中较大的值减一,遍历数组,如果出现dp[i]<0,则说明到达不了最后一个位置
public boolean canJump(int[] nums) {
if(nums==null||nums.length==0)
return true;
int n=nums.length;
int[] dp=new int[n];
for(int i=1;i<n;i++)
{
dp[i]=Math.max(dp[i-1], nums[i-1])-1;
if(dp[i]<0)
return false;
}
return true;
}
Runtime: 4 ms, faster than 83.09% of Java online submissions for Jump Game.
Memory Usage: 39.7 MB, less than 91.91% of Java online submissions for Jump Game.
解法二
遍历数组并用一个数reach纪录所能到达的最远位置,如果reach小于当前位置了,说明它达不到当前位置,则退出循环,如果reach大于或等于最后一个索引的位置,则说明它可以达到最后一个位置,可以提前退出循环
public boolean canJump(int[] nums) {
if(nums==null||nums.length==0)
return true;
int n=nums.length;
int reach=0;
for(int i=0;i<n;i++)
{
if(i>reach||reach>=n-1)
break;
reach=Math.max(reach,nums[i]+i);
}
return reach>=n-1;
}
Runtime: 3 ms, faster than 100.00% of Java online submissions for Jump Game.
Memory Usage: 39.2 MB, less than 92.53% of Java online submissions for Jump Game.
python版
class Solution:
def canJump(self, nums: List[int]) -> bool:
reach=0
n=len(nums)
for i in range(n):
if i>reach or reach>=n-1:
break
reach=max(reach,i+nums[i])
return reach>=n-1
Runtime: 52 ms, faster than 57.15% of Python3 online submissions for Jump Game.
Memory Usage: 14.7 MB, less than 5.28% of Python3 online submissions for Jump Game.